Activation of Incompletability

• Activation of incompletability is a framework defining conditions under which formal systems fail to achieve effective completion despite abstract consistency.
• It contrasts potential completability with constructive completion through mechanisms like effective inseparability, bounded axiomatizability, and self-referential triggers.
• Key mechanisms include syntactic thresholds, local proof-closure constraints, and operational triggers in quantum settings that enforce unavoidable incompleteness.

“Activation of incompletability” is best understood as an Editor’s term for a family of trigger phenomena in which incompleteness, incompletability, or non-axiomatizability becomes operational only after specific syntactic, semantic, computational, or measurement-theoretic conditions are imposed. In some settings the trigger is self-reference plus a provability mechanism; in others it is bounded quantifier complexity, local proof-closure constraints, effective revision-and-stabilization, sublinear observational limits, or orthogonality-preserving LOCC transformations. The common theme is not incompleteness simpliciter, but the passage from a background possibility of semantic excess to a concrete obstruction against completion, finite certification, or local reconstruction (Kurahashi et al., 2023).

1. Conceptual scope

A useful starting point is the distinction between completability in principle and constructive or effective completion. One computational reading of Gödel’s phenomenon states that consistency always permits completion in the abstract, while incompleteness consists in the failure of effective completion for some consistent recursively enumerable theories (Salehi, 2012). In that sense, incompletability is activated when one strengthens “there exists a complete extension” to “there exists a complete extension with the required effective or structural form.”

This perspective recurs in several later literatures. In effective recursion-theoretic form, a theory is not merely incomplete if every consistent extension remains incomplete; rather, incompletability becomes active when there is a uniform computable mechanism that, from a presentation of an extension, produces a new independent sentence. The decisive notion here is effective inseparability, which is shown to be equivalent to several effective incompleteness notions for consistent c.e. theories (Kurahashi et al., 2023).

A broader implication is that “activation” usually names a threshold phenomenon. Before the threshold, the relevant object may still be consistent, locally distinguishable, semantically valid, or extendible. After the threshold is crossed, some combination of reflection, self-reference, local closure, or observational restriction prevents completion in the targeted sense. This suggests that the topic is not a single theorem-schema but a comparative framework for identifying the structural conditions under which incompleteness becomes unavoidable.

2. Arithmetical trigger conditions

One precise classification of self-unprovability in second-order arithmetic varies three parameters: the soundness assumption $X$, the definability complexity $Y$, and the soundness statement $Z$, each in $\{\Sigma^1_1,\Pi^1_1\}$. The internal soundness principle is formalized as

$$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$

The classification result states that among the eight triples $(X,Y,Z)$, exactly two yield a general self-unprovability theorem, and the other six fail (Towsner et al., 2024).

Triple $(X,Y,Z)$	Status	Strength requirement
$(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$	Holds	extension of $\Sigma^1_1\text{-}\mathsf{AC}_0$
$(\Sigma^1_1,\Pi^1_1,\Sigma^1_1)$	Holds	extension of $Y$0
Remaining six triples	Fail	witnessed by explicit constructions

The significance of this classification is that incompleteness is not uniformly activated by “a sound theory proves its own soundness.” It is activated only in the two crossed cases above; in the remaining cases, suitably engineered $Y$1- or $Y$2-definitions allow sound theories to prove their own corresponding soundness statements (Towsner et al., 2024). A plausible implication is that higher-order Gödel phenomena are sharply parameter-sensitive rather than monotone in proof-theoretic strength alone.

A different activation mechanism appears in boundedly axiomatizable theories. For every fixed $Y$3, every consistent sequential theory in a finite language that is axiomatized by $Y$4-sentences is incomplete. The proof combines bounded truth predicates, Rosser provability

$Y$5

and Tarski’s undefinability theorem (Enayat et al., 2023). Here incompleteness is activated by a syntactic bound: once all axioms live inside one fixed quantifier-alternation class, partial truth for that class plus completeness would collapse into a full truth definition.

3. Stable, evolving, and effective theories

A major generalization replaces ordinary c.e. axiomatizability by stable computable enumerability, where membership is determined by eventual stabilization after provisional assertions and retractions. For a computable map

$Y$6

the stabilization $Y$7 consists of those elements eventually asserted and never later withdrawn. A formal system $Y$8 is stably c.e. if $Y$9 for some total computable

$Z$0

For such systems, direct analogues of Gödel’s first and second incompleteness theorems hold: if $Z$1, one can effectively construct $Z$2 such that $Z$3 under 1-consistency and $Z$4 under 2-consistency; moreover $Z$5 cannot prove its own 1-consistency (Savelyev, 2022).

The technical mechanism uses computable operators $Z$6, $Z$7, $Z$8, and $Z$9. The speculative operator $\{\Sigma^1_1,\Pi^1_1\}$0 enlarges a stable theory by adding universal claims whenever all $\{\Sigma^1_1,\Pi^1_1\}$1-decidable instances are $\{\Sigma^1_1,\Pi^1_1\}$2-provable, and 1-consistency is exactly what preserves consistency under this speculative enrichment (Savelyev, 2022). In this line of work, incompletability is activated not by ordinary enumeration but by effective revision-plus-stabilization.

A related 2020 paper states, at the level of its abstract, that it partly develops a mathematical notion of stable consistency and generalizes the first and second Gödel incompleteness theorems to stably $\{\Sigma^1_1,\Pi^1_1\}$3-consistent formal systems, re-proving the original incompleteness theorems from first principles using Turing-machine language rather than the diagonal lemma (Savelyev, 2020). The supplied material does not include the definitions or proofs, so the exact technical role of “stable consistency,” “stable 1-consistency,” and “stable 2-consistency” cannot be reconstructed more precisely from the present record.

The effective recursion-theoretic literature makes the activation theme explicit. For a consistent c.e. theory $\{\Sigma^1_1,\Pi^1_1\}$4, the following are equivalent: effective $\{\Sigma^1_1,\Pi^1_1\}$5-inseparability, effective essential $\{\Sigma^1_1,\Pi^1_1\}$6-creativity, effective essential $\{\Sigma^1_1,\Pi^1_1\}$7-incompleteness, and effective if-essential $\{\Sigma^1_1,\Pi^1_1\}$8-incompleteness (Kurahashi et al., 2023). Thus the active form of incompletability is the existence of a partial computable function that, from a presentation of a consistent extension, outputs an independent sentence in the required witness class. The paper also separates intensional finite extension from extensional finite extension: the former aligns with effective inseparability, while the latter can already occur in decidable theories (Kurahashi et al., 2023).

4. Proof-theoretic and semantic activation mechanisms

In cyclic proof theory for the modal $\{\Sigma^1_1,\Pi^1_1\}$9-calculus, incompleteness can be triggered by a mismatch between global trace conditions and local closure devices. Kloibhofer proves that the cyclic, cut-free system $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$0 is incomplete by exhibiting a valid sequent

$$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$1

that is not provable in $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$2 (Kloibhofer, 2023). The semantic proof exists in the infinitary system $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$3, where every infinite branch needs a $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$4-trace, but $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$5 compresses this via local annotations and the rule $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$6. The key structural facts are that every unfolding node has either two or three children with exactly one $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$7-node and exactly one $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$8-node, and that a closure on $$\mathsf{RFN}_\Gamma(U):= \forall \varphi \in \Gamma\big( \mathsf{Pr}_U(\varphi) \to \mathsf{True}_\Gamma(\varphi) \big).$$9 cannot discharge inside an $(X,Y,Z)$0-subtree, dually for $(X,Y,Z)$1 and a $(X,Y,Z)$2-subtree (Kloibhofer, 2023). Here incompleteness is activated when two greatest-fixpoint threads must recombine globally but the local naming discipline cannot synchronize them.

A related mechanism appears in modal algebraic semantics. Complete additivity $(X,Y,Z)$3 for Boolean algebras with operators is shown to be first-order equivalent to the condition

$(X,Y,Z)$4

This extra semantic closure principle can force consequences not derivable in the modal logic itself, yielding $(X,Y,Z)$5-incompleteness. The paper isolates an abstract collapse theorem: if $(X,Y,Z)$6 is completely additive and

$(X,Y,Z)$7

for all $(X,Y,Z)$8, then $(X,Y,Z)$9 (Holliday et al., 2018). This explains why van Benthem’s logic $(X,Y,Z)$0 and the bimodal provability logic $(X,Y,Z)$1 are already incomplete with respect to completely additive BAOs. In this setting, incompleteness is activated by Löb-like fixed-point patterns under a completely additive operator.

Quantified conditional logic provides a semantic analogue. Stalnaker–Thomason’s quantified system is complete for a formula-sensitive semantics using quasi-selection functions

$(X,Y,Z)$2

but not for the intended proposition-based semantics with

$(X,Y,Z)$3

Once selection functions are required to take propositions as arguments, the logic becomes frame incomplete (Kocurek et al., 3 Feb 2026). The witnessing principle is

$(X,Y,Z)$4

whose negation is valid on all weakly Stalnakerian frames but not derivable in the logic (Kocurek et al., 3 Feb 2026). Here the trigger is the shift from formula-sensitive to proposition-sensitive selection.

5. Finite-domain, combinatorial, and process-level analogues

In the proof-complexity and bounded-arithmetic literature, incompleteness is recast as feasible incompleteness. The central idea is that true finite statements may have no polynomial-size proofs in weak theories, or their proofs may not be constructible in polynomial time. The finite consistency statement $(X,Y,Z)$5 and finite reflection principles such as $(X,Y,Z)$6 become the main objects, with conjectures $(X,Y,Z)$7, $(X,Y,Z)$8, $(X,Y,Z)$9, and $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$0 expressing that weaker theories cannot efficiently certify bounded consistency or bounded soundness of stronger ones (Pudlak, 2016). In this regime, incompletability is activated by computational hardness: if proofs or reflection were easy, associated search problems would become unexpectedly tractable.

A classical natural instance is the Paris–Harrington principle. It strengthens finite Ramsey theory by requiring the homogeneous set $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$1 to satisfy

$(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$2

The paper presents Paris–Harrington as the point where incompleteness becomes visible in ordinary finite mathematics: a true combinatorial statement, arithmetically codable, but not provable in $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$3 (Valle, 2018). This is a concrete activation of incompleteness inside finite combinatorics rather than metamathematical self-reference.

A recent finite SAT analogue pushes this theme into logarithmic-width $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$4-SAT. The paper constructs structurally irreducible SAT/UNSAT pairs by using the unique satisfying assignment of a formula $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$5 to define a new clause $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$6 and then setting

$(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$7

where $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$8 is redundant and $(\Pi^1_1,\Sigma^1_1,\Pi^1_1)$9 is the unique satisfying assignment (Fang et al., 2 Jul 2026). The thesis is that local sublinear views cannot distinguish the SAT and UNSAT instances. The paper further states lower bounds of the form

$\Sigma^1_1\text{-}\mathsf{AC}_0$0

interpreting this as a finite combinatorial analogue of Gödelian incompleteness (Fang et al., 2 Jul 2026). A cautious reading is appropriate here: the paper presents these as theorematic and interpretive consequences of its construction.

At the level of computational processes, however, activation can fail. Sutner defines a computational process as a pair $\Sigma^1_1\text{-}\mathsf{AC}_0$1 with evolution $\Sigma^1_1\text{-}\mathsf{AC}_0$2, observed by a constant-space observer $\Sigma^1_1\text{-}\mathsf{AC}_0$3 via

$\Sigma^1_1\text{-}\mathsf{AC}_0$4

A process is intermediate if it is undecidable but not complete. The main negative result is that the simplified Friedberg–Muchnik priority argument does not yield an intermediate computational process, because the process carries enough auxiliary information that $\Sigma^1_1\text{-}\mathsf{AC}_0$5 is complete (0906.3228). This suggests that constructing an intermediate object is weaker than activating incompletability at the level of an observable dynamical process.

6. Quantum-information usage and hierarchy

In quantum information theory, “activation of incompletability” is an explicit operational notion. For a set of orthogonal product states, completability means extendibility to a complete orthonormal product basis of the given Hilbert space, incompletability means no such completion exists, and strict incompletability means no such completion exists even after embedding into a larger Hilbert space (Das et al., 1 Jul 2026). A locally distinguishable set is incompletability activable if an orthogonality-preserving local measurement transforms it into a locally incompletable orthogonal set.

The paper proves the existence of sets that are initially perfectly distinguishable by LOCC and free from local redundancy, but that can be transformed deterministically into strictly incompletable sets via OPLM. In the main example, a $\Sigma^1_1\text{-}\mathsf{AC}_0$6 product set is projected branchwise onto copies of the standard $\Sigma^1_1\text{-}\mathsf{AC}_0$7 five-state UPB, yielding strict incompletability (Das et al., 1 Jul 2026). It further proves the hierarchy

$\Sigma^1_1\text{-}\mathsf{AC}_0$8

while the converse fails: a second example activates local indistinguishability without activating incompletability (Das et al., 1 Jul 2026). Thus activation of incompletability is a strictly stronger phenomenon than activation of nonlocality.

A companion result sharpens the necessity direction for nonlocality without entanglement. Any complete orthogonal product basis that is initially locally distinguishable remains so under all orthogonality-preserving local projective measurements and classical communication. Hence activation of nonlocality without entanglement requires incompleteness of the initial set, at least for the OP-LPCC/LPCC protocols studied there (Bhunia et al., 28 May 2026). In this domain, incompletability is not merely a logical limitation but a structural resource governing when local-to-nonlocal transitions are possible.

7. Significance, boundaries, and open directions

Across these literatures, activation of incompletability marks a shift from passive incompleteness to structurally forced failure of completion. The trigger may be semantic, as in proposition-based conditional semantics (Kocurek et al., 3 Feb 2026); syntactic, as in boundedly axiomatizable sequential theories (Enayat et al., 2023); proof-theoretic, as in cyclic closure systems for the $\Sigma^1_1\text{-}\mathsf{AC}_0$9-calculus (Kloibhofer, 2023); recursion-theoretic, as in effective inseparability (Kurahashi et al., 2023); complexity-theoretic, as in finite reflection and TFNP conjectures (Pudlak, 2016); or operational, as in LOCC state discrimination (Das et al., 1 Jul 2026).

The topic also has a strong boundary-drawing function. Several papers show that a naive extension of a familiar incompleteness slogan fails. Not every sound theory is barred from proving its own soundness; only two second-order complexity patterns survive (Towsner et al., 2024). Not every quantum activation of nonlocality is an activation of incompletability (Das et al., 1 Jul 2026). Not every construction of an intermediate degree yields an intermediate computational process (0906.3228). Not every completeness theorem for a formula-sensitive semantics extends to proposition-sensitive frames (Kocurek et al., 3 Feb 2026).

Open problems remain correspondingly domain-specific. For $(\Sigma^1_1,\Pi^1_1,\Sigma^1_1)$0, the failure of completeness leaves open whether Kozen’s axiomatization can be proved complete proof-theoretically without reducing to the aconjunctive fragment, and whether there exists a finitary, well-founded, cut-free, complete proof system for the modal $(\Sigma^1_1,\Pi^1_1,\Sigma^1_1)$1-calculus (Kloibhofer, 2023). For quantified conditionals, the incompleteness result leaves open whether adding further principles such as $(\Sigma^1_1,\Pi^1_1,\Sigma^1_1)$2, or strengthening the ambient modal assumptions, can recover a satisfactory proposition-based completeness theorem (Kocurek et al., 3 Feb 2026). For stable consistency in the sense advertised in 2020, the exact formal content remains inaccessible here because the supplied material does not include the definitions and proofs (Savelyev, 2020).

Taken together, these developments support a general characterization. Activation of incompletability occurs when a domain admits enough internal structure to formulate completion or certification problems, but the same structure also introduces a higher-order obstacle—global trace dependence, bounded-truth collapse, revision-stabilization, computational hardness, or local observational insufficiency—that defeats the intended closure. In that sense, the topic is a comparative study of the exact conditions under which incompleteness becomes not merely present, but unavoidable.