Procedural Truth Logic (PTL): A Terminating Framework for Evaluating Self-Referential Propositions

This paper introduces Procedural Truth Logic (PTL), a framework for evaluating self-referential propositions through procedural behavior rather than static truth assignment. PTL distinguishes between evaluation behavior and MetaTruth, allowing for deterministic binary classification even in cases where classical logic encounters paradox or indeterminacy. By introducing a terminating MetaTruth evaluation operator, PTL avoids infinite regress while preserving compatibility with classical logic. The framework provides a structured method for analyzing recursive semantic systems and reframes paradoxes as predictable outcomes of procedural evaluation.