jst Pp: Internal Justification in CMST

• jst Pp is a primitive relation in Constructive Morse Set Theory that internalizes proof-objects as constructive justifications according to the BHK interpretation.
• It establishes a uniform framework where terms and formulae blend, enabling justification sets to formalize the algebra of conjunctions, disjunctions, implications, and bounded quantifiers.
• The framework enforces uniqueness and coherence of justifications, ensuring that a single proof-object cannot validate incompatible propositions.

Searching arXiv for the specified paper and closely related work to ground the article. arxiv_search(query="(Bridges, 18 Jun 2026) Constructive Morse Set Theory jst Pp", max_results=5) Searching for the exact arXiv identifier and title. {"query":"(Bridges, 18 Jun 2026) Constructive Morse Set Theory jst Pp","max_results":5} Searching arXiv for related CMST and justification-theoretic material. {"query":"Constructive Morse Set Theory justification jst Pp","max_results":10} $\mathsf{jst}\,Pp$ is a primitive relation introduced within Constructive Morse Set Theory (CMST) to express that $P$ justifies $p$, or, in the intended Brouwer–Heyting–Kolmogorov (BHK) reading, that $P$ is a constructive witness, proof-object, or justification of the proposition $p$ (Bridges, 18 Jun 2026). The notion is designed to internalize proof-theoretic content inside set theory itself rather than treating proofs externally. Because CMST makes no distinction between terms and formulae, it supplies a setting in which justificatory objects and propositions can be handled uniformly. The resulting axiomatization is intended to align, with explicit restrictions, with the BHK interpretation of the axioms of intuitionistic logic.

1. Primitive notion and ambient framework

The basic orienting clause is

$\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$

The paper formalizes this by the abbreviation

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$

Within the same framework, the justification set of a proposition $p$ is defined by existential abstraction: $$(\mathsf{J}p \equiv \mathsf{E}X\,\mathsf{jst\,}Xp).$$ This yields the derived bridge theorem

$$(P \in \mathsf{J}p \leftrightarrow \mathsf{jst\,}Pp). \tag{4.4.1}$$

These clauses make $P$0 the set of all justificatory objects for $P$1, while $P$2 remains the primitive relation from which that set is generated. The framework is explicitly internal: proof-objects are treated as CMST terms, and propositions are handled in the same formal universe. This suggests that the theory is not merely a semantic gloss on intuitionistic proof, but an attempt to embed proof-objects as first-class set-theoretic entities (Bridges, 18 Jun 2026).

2. Basic axioms and the structure of justification sets

The first general axiom requires every justification to be a well-constructed object: $P$3 From this and the definition of $P$4, the paper derives

$P$5

A second foundational clause is a soundness or coherence principle for individual justifications: $P$6 If the same object $P$7 justifies both $P$8 and $P$9, then $p$0 and $p$1 must be equivalent. A single justification therefore cannot support incompatible propositions.

Taken together, these principles fix the basic ontology of the theory. Justifications are not arbitrary objects; they belong to $p$2, and their assignment to propositions is constrained by a strong uniqueness-of-content condition. A plausible implication is that the theory is engineered to prevent proof-objects from behaving like untyped certificates that can be re-used indiscriminately across logically distinct statements. Instead, each justification carries determinate propositional content in a way compatible with constructive semantics (Bridges, 18 Jun 2026).

3. Logical connectives under the BHK reading

The central axioms for conjunction, disjunction, and implication are presented as direct formalizations of the BHK interpretation.

For conjunction,

$p$3

A derived form states

$p$4

Thus a justification of $p$5 is an ordered pair whose components justify the conjuncts.

For disjunction,

$p$6

The corresponding derived theorem is

$p$7

The tag $p$8 selects the left disjunct and the tag $p$9 the right. The expected injections are also proved: $P$0

$P$1

For implication,

$P$2

This yields

$P$3

A justification of $P$4 is therefore a function from justifications of $P$5 to justifications of $P$6.

The paper derives internal realizations of standard intuitionistic axiom schemes from these clauses. Among the explicitly listed examples are $P$7, $P$8, $P$9, $p$0, $p$1, $p$2, $p$3, and $p$4 (Bridges, 18 Jun 2026). In this sense, the algebra of pairs, tagged pairs, and functions is not auxiliary notation; it is the internal proof-object content of the connectives themselves.

4. Restricted quantifiers and the role of $p$5

The theory extends the BHK treatment to bounded quantification, but only under an explicit restriction to sets $p$6.

For bounded universal quantification, the axiom is: $p$7 A derived theorem gives the more explicit form

$p$8

For bounded existential quantification, the axiom is: $p$9 The intended interpretation is that a justification of $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$0 is an ordered triple consisting of a witness $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$1, a justification that $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$2, and a justification of $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$3.

These quantifier clauses follow the standard BHK pattern only in bounded form. The paper explicitly argues that replacing them with unrestricted quantification over all of $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$4 produces contradiction: by taking $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$5 and exploiting the theory’s coding of functions and domains, one can derive $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$6. The same collapse occurs for the analogous unrestricted existential axiom. The restriction $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$7 is therefore essential rather than cosmetic (Bridges, 18 Jun 2026).

A common misunderstanding would be to read the theory as providing a global proof semantics for arbitrary quantification over the universe. The paper rules this out. The justification axioms for quantifiers are valid only when the domain is itself a well-constructed set.

5. Negation, double negation, and the special axiom for membership in $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$8

Negation is defined by implication to falsity: $\mathsf{jst}\,Pp \quad \text{“%%%%5%%%% justifies %%%%6%%%%”}.$9 The paper derives a sequence of characteristic results: $$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$0

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$1

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$2

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$3

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$4

These formulas identify negation with emptiness of the original justification set, while also showing that if $$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$5 is justified, its justification is the null object $$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$6.

For double negation, the paper proves

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$7

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$8

and

$$(\mathsf{jst\,}Pp \equiv (P\ \mathsf{justifies}\ p)).$$9

The last theorem identifies the canonical justification of $p$0 with the constant-zero function on $p$1.

A further axiom gives a proof-object for the fact that a justification is indeed a member of a justification set: $p$2 The paper remarks that this principle may appear surprising, but uses it to derive a choice theorem from justification sets. In particular, it obtains an explicit choice theorem of the form

$p$3

and contrasts this with a weaker existential version available without axiom (4.3.10). This suggests that the axiom is not needed for the core BHK interpretation of the connectives, but strengthens the constructive extraction of witnesses from proof-objects (Bridges, 18 Jun 2026).

6. Conceptual significance and logical scope

The paper’s overall claim is that axioms (4.3.5)–(4.3.9) reflect the BHK interpretation of the logical constants and restricted quantifiers. Under this reading, the structure of proof is internalized as follows: a proof of $p$4 is a pair, a proof of $p$5 is a tagged proof, a proof of $p$6 is a function, a proof of $p$7 is a function defined on proofs of membership in $p$8, and a proof of $p$9 is a witness together with the relevant membership proof and proof of the predicate (Bridges, 18 Jun 2026).

The resulting calculus validates many ordinary intuitionistic axiom schemata inside CMST itself. At the same time, the theory is explicitly limited. Quantification must be bounded by $$(\mathsf{J}p \equiv \mathsf{E}X\,\mathsf{jst\,}Xp).$$0, and unrestricted quantifier justifications are inconsistent. The framework is therefore constructive and internal, but not unrestrictedly impredicative.

A plausible implication is that $$(\mathsf{J}p \equiv \mathsf{E}X\,\mathsf{jst\,}Xp).$$1 should be understood as an internal proof-theoretic infrastructure for CMST rather than as a universal theory of proof in all contexts. Its significance lies in showing that a set-theoretic environment with a term/formula identification can support a detailed algebra of justifications whose theorems mirror the intended meaning of intuitionistic logic. In that sense, $$(\mathsf{J}p \equiv \mathsf{E}X\,\mathsf{jst\,}Xp).$$2 functions as the central connective tissue between CMST’s ontology of constructed objects and the BHK conception of proof.