P-complete – Wikipedia
“In computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to it by an appropriate reduction.”
Ergo: **All existence can be explained by reduction to the first principles of evolutionary computation. In other words, anything that can exist can be reduced to a formal description in P-Law.**
I abandoned the term ‘propertarianism’ since it applied only to the original system of measurement in morality. I kept the “P-” for P-Completeness. And because ‘-ism’ implies a p philosophy, and P-Law is a formal logic: a science that unifies the logics and sciences.
Ergo P-Law is P-Complete.
NOTE: P-Law accounts for the first principle, evolutionary computation, non-closure and the grammatical requirement for continuous recursive disambiguation.