Axiomatic Justification in Constructive Morse Set Theory

Abstract: Working within Constructive Morse Set Theory (CMST), we introduce axioms for a new notion, jst Pp, intended to capture what it means for P to prove, or justify, p under the BHK interpretation of intuitionistic logic. Since it makes no distinction between terms and formulae -- every term is also a formula, and vice versa -- CMST is well suited to our axiomatic development of justification theory within set theory itself. After stating our axioms for jst Pp, we derive many consequences thereof. In particular, we show that (with certain restrictions) our axioms for jst Pp align with the intended BHK interpretations of the axioms of intuitionistic logic.

• The paper introduces a rigorous axiomatic framework that formalizes justification theory in CMST by internalizing the BHK interpretation.
• It establishes definitional axioms and constrains quantification to well-formed sets to ensure consistency and faithfully represent logical operations.
• The framework supports practical applications in computer-assisted proof verification and program extraction by treating justifications as computational witnesses.

Axiomatic Framework for Justification in Constructive Morse Set Theory

Overview

The paper "Axiomatic Justification in Constructive Morse Set Theory" (2606.19707) introduces a formal system for justification theory within the context of Constructive Morse Set Theory (CMST), a constructive counterpart to classical Morse Set Theory. CMST is built on intuitionistic logic and incorporates the distinctive property that all mathematical or logical objects are treated as both sets and propositions. This feature enables the inclusion of internal representations of proofs—termed justifications—in CMST, facilitating a realization of the Brouwer-Heyting-Kolmogorov (BHK) interpretation entirely within set theory.

Definitions and Axioms

The justification theory developed in the paper formalizes the concept of a term $P$ justifying a proposition $p$ via a predicate $\mathsf{jst\,}Pp$, where both $P$ and $p$ are terms/formulas in CMST. The notion of the justification set $\mathsf{J}p$ is defined via existential quantification over justifiers. The axiomatic foundation for justification is established through:

• Definitional axioms that bridge set-theoretic operations, ordered pairs, functions, and justification predicates.
• Axioms directly reflecting the BHK interpretation for logical connectives and quantifiers.
• Restrictions confining quantification to well-constructed sets (members of the universe $\mathsf{U}$), thus avoiding unrestricted quantification.

Key axioms include the assertion that a proposition is equivalent to the existence of a justification, the construction of justification sets as well-formed elements of $\mathsf{U}$, and the alignment of the justification structure for compound propositions (e.g., conjunction, disjunction, implication) with functions, pairs, and triples as appropriate for the BHK interpretation.

Theorems and Consequences

The system admits robust theorems characterizing logical operations:

• $\mathsf{J}p$ is both the set of justifiers and an element of $\mathsf{U}$.
• Negation is realized as the absence of justification: $p$0.
• Double-negation and implication are characterized in terms of function spaces and the existence of certain mappings (e.g., $p$1).
• Justification for quantifiers and logical connectives are expressed via functions on justification sets, maintaining the constructive nature of the theory.

A notable claim is the derivation of principles of choice for justification sets, primarily due to axiom (4.3.10), which asserts that for every $p$2 in a justification set there is a unique justification certifying $p$3’s role.

The system strictly rejects unrestricted universal quantification, providing rigorous counterexamples showing that such an axiom would inevitably lead to inconsistency (specifically, $p$4).

Validation of Intuitionistic Logic Axioms

The justification-theoretic axioms are shown to validate the standard intuitionistic propositional and predicate logic axioms in the language of CMST, explicitly reconstructing the justification structure for:

• Identity, implication, conjunction, disjunction, and their interaction (closure under conjunction/disjunction, distributivity, etc).
• Quantification over well-constructed sets, thus aligning with constructive mathematical practice as advocated by Bishop and furthered in CMST.

Choice Principles and the Axiom of Choice

The paper addresses the constructive analogue of the axiom of choice, demonstrating that full choice over justification sets implies the law of excluded middle, echoing classical results by Diaconescu and Goodman/Myhill. The restricted version of choice derivable in CMST is sufficient for constructive mathematics, thereby circumventing the inconsistency of full choice, but still enabling explicit construction of choice functions within the universe $p$5.

Practical and Theoretical Implications

The foundational system developed provides a rigorous internal realizability interpretation of proofs in constructive mathematics, without reliance on external metamathematical machinery. It ensures that justifications are structured objects within CMST, and that the BHK interpretation is faithfully internalized, preserving constructive principles and avoiding classical paradoxes.

This framework has substantial implications for the formalization of constructive mathematics, particularly for computer-assisted proof assistants and explicit program extraction, whereby justifiers can be treated as computational witnesses. Furthermore, the restriction to well-constructed sets is in line with both practical needs (as in Bishop-style constructivism) and theoretical obligations to avoid contradictions arising from unrestricted universes.

Future developments may involve refining the treatment of principles of choice in constructive settings, extending the integration with realizability models, or exploring the relation between CMST and type-theoretic or categorical approaches to constructive logic and justification.

Conclusion

The paper establishes a comprehensive axiomatic system for justification in CMST, characterized by internal representations of proofs adhering to the BHK interpretation. Its rigorous restriction of quantification domains preserves consistency and aligns with constructive practice, and its validation of intuitionistic logic axioms demonstrates the adequacy of the framework. The system offers a robust foundation for constructive mathematics, with explicit implications for formal verification, program extraction, and foundational investigations in constructivism.