Manuscript: What is Reflexica?

What is Reflexica?

1 Introduction

From an intuitionistic perspective [Brouwer, 1913], the distinction between classical and constructive logic resembles a debate between two attitudes toward the existence of what our concepts purport to describe: vitalism and mechanism.

Classical logic, particularly when viewed through a Platonist lens, permits a certain generosity: a proposition is true or false independently of our judgment; hence, the semantic distinction is presumed complete even in the absence of a means of deciding it. In this respect, classical logic resembles the vitalist's confidence that life constitutes something real and unified, irreducible to the particular operations through which it manifests itself. The unity precedes its explanation. A more Brouwerian standpoint partially reverses this order without committing to its ontological opposite. What classical reasoning accepts as a completed division, intuitionistic reasoning approaches more parsimoniously, through the acts by which either side could be established. This latter resemblance lies in the refusal to endow a concept with independent truth merely because its use is productive.

The distinction between living and nonliving things becomes less secure when formulated at a sufficiently high level of generality: fire consumes, propagates, and maintains itself through exchanges with its environment; viruses reproduce, but only through a host's capabilities. Neither phenomenon compels us to abandon the distinction; rather, each reveals how much depends on the criteria by which it is drawn. The concept remains useful even as the possibility of identifying a single essence corresponding to its entire extension becomes questionable.

In light of these examples, we reopen the question of the epistemic status of the completeness that classical semantics permits us to assume. The point is not that fire must somehow be both alive and not alive, or that a mathematical proposition must inhabit a third truth value, but that intuition can function with remarkable success long before we have established what, if anything, guarantees its unrestricted application. A completed classification may afford useful compression, yet that usefulness may be mistaken for evidence that the concept has captured an independently completed domain.

Reflexica concerns limits that cannot be certified without reproducing the conditions under which they arise. If the mind is assumed to be finite and computational, the paradigm case is the Halting Problem viewed from within such a mind. The object of scrutiny is a specific passage from formal success to semantic authority: the inference that, because a framework can consistently describe a completed totality, that totality has acquired independent epistemic warrant.

The analysis begins where classical and intuitionistic reasoning appear to have the least reason to disagree: the elementary arithmetic of prime numbers. Book IX, Proposition 20 of Euclid’s Elements [Euclid, 1956] makes no claim about a completed set of primes. It presents what may be read as a proto-constructive procedure:

We recall the Tristram Shandy Paradox [Russell, 1903] and suspend judgment on whether a procedural reading accepts only the results reached by the construction. Thus, given any finite collection of primes, the procedure constructs a number that is coprime to each member and can be iterated without end.

By contrast, Platonic reasoning treats existential quantification over a completed domain as cost-free, preserving the theorem while obscuring the difference between a domain-level proposition and a witness produced by a construction. Proof-theoretic semantics makes this difference explicit [Gentzen, 1935]. A classical proof admits the existential claim $\exists x:A\,P(x)$; its constructive interpretation supplies data: an object $a:A$ together with evidence for $P(a)$. Under Propositions-as-Types, an inhabitant of $\Sigma_{x:A} P(x)$ represents this information [Howard, 1980].

This distinction places primality in proximity to a negation: a proof that a number is composite provides a finite, extractable, and a priori witness, not merely a certificate. For Compositeness, the factor pair $(a,b)$ supplies the proof’s computational content [Kleene, 1945]. Hence:

An example below shows this asymmetry.

We can define Compositeness generally:

And thence, provide a finite factor witness $(a,b)$. Bounded exclusion yields the natural form of Primality:

The left arrangement exhibits a factorization; the right admits no nontrivial rectangle, because seven has no nontrivial divisor. Trial division establishes Primality by exhaustive bounded elimination, and a Pratt Certificate does so with a succinct, recursively checkable proof object [Pratt, 1975]. Both certify that no divisor exists; neither exhibits a constituent whose presence makes the number prime.

Euclid’s argument requires only this exclusion. The constructed number exceeds a common multiple of the assigned primes by one, so none of them divides it, and a decidable bounded search yields a prime divisor $q$ outside the collection, whether the number itself is prime or composite. The argument is therefore intuitionistically valid. What matters is not the existential form but whether a witness is constructed over an open-ended type or quantified over a completed totality.

The contemporary restatement, “there are infinitely many primes,” admits two readings. Procedurally, it abbreviates what Euclid proves: for every finite set $S$ of primes, a prime $q\notin S$ can be constructed. Extensionally, it asserts that the primes form a completed infinite totality. The extensional reading introduces no contradiction and leaves local practice intact; it changes only the semantic status of the object it introduces, and this apparent harmlessness makes it easy to accept. Euclid’s argument warrants the first reading. Whether anything warrants the second depends on what “infinity” is taken to contribute:

2 Characterization

2.1 Reflection Mistaken for Authority

By the early twentieth century, logicians and mathematicians could no longer dismiss some philosophical tensions as quirks [Gödel, 1931] [Heyting, 1931]. A theory can remain locally impeccable while its existential conclusions carry a stronger commitment. This commitment comes from how the theory interprets those conclusions and exceeds what its procedure supports. The classical statement also defines an epistemic position.

A productive procedure may repeatedly yield intelligible results. Yet its success does not show that it reveals a completed semantic totality, nor must it assume global authority to remain effective.

The Brouwer–Heyting–Kolmogorov Interpretation (or bhk) makes this distinction precise. The proposition $\bot$ admits no construction, while a construction of $\neg A$ is a procedure that transforms any construction of $A$ into $\bot$ [Troelstra and van Dalen, 1988]. Reflexica asks what happens when agents reify such an absence, treating an obstruction as a semantic primitive.

Drawing on Intuitionistic Type Theory [Martin-Löf, 1984] and constructive mathematics [Beeson, 1985], Reflexica asks whether their insights support empirical predictions in domains where classical logic makes closure claims. Homotopy Type Theory [Univalent Foundations Program, 2013] may merit particular attention.

2.2 The Zeroth World

“Reflexica” is intentionally antiphrastic. Borrowing from Impagliazzo’s Five Worlds Taxonomy for average-case complexity [Impagliazzo, 1995], it names a missing “zeroth world”: not an independently inhabited domain, but a semantic space generated when a theory reflects on its own limits.

The zeroth world arises through a recurring transition. A practice encounters the absence of a method, stabilizes that absence as a problem, and builds it into its semantic architecture. Complexity theory is both an instance and a diagnostic site. A formulation may presuppose a consistent classical totality even when the mathematical practice it supports remains procedural and open-ended. Reading its existential claims as procedural shorthand then conceals the additional commitment to a completed domain.

Our hypothesis is that the obstruction is structural, not merely a limitation of a particular formalism or theorist. When Reflection Principles extend a theory beyond a local obstruction, their productivity may be mistaken for access to an independent domain. The system then iterates its own resources rather than reaching an external source of closure. Greater rigor can intensify the error by concealing self-extension as discovery.

Reflexica therefore applies this diagnosis to itself. It introduces its semantic space explicitly, parsimoniously, and only once; it neither treats that construction as necessary across domains nor takes Reflexica itself as an independently given object of quantification. This restraint marks the difference between reflective reconstruction and discovery. Without it, operations internal to a framework may appear to disclose an external domain.

A minimal formal analogue is an attempted fixed point of negation. Whatever semantic completeness an agent attributes to its constructions, ordinary finite syntax blocks the simplest identification: no finite formula can be syntactically identical to its own negation.

The proposed obstruction has the schematic form: for every proposed semantic source or self-model, there is a reflexive circumstance in which every attempted completion fails. Formalizing this $\forall\exists\forall$ pattern requires explicit domains and a precise failure predicate. Its classification within the Arithmetical Hierarchy remains an obligation of that formalization.

The same structural constraint governs logical systems, reification, and human cognition. No agent can reach a semantic standpoint outside the totality that contains that agent. Therefore, no final external criterion can measure the authority of a semantic source.

Humans nevertheless need stable semantic orientation, or closure. They use language, memory, culture, science, institutions, biography, and technical representation as semantic sources. Humans can systematically reify these sources instead of only using them. Without a semantic totality, a semantic source functions as reality itself. Different access to a shared truth does not primarily explain disagreement about non-constructive content. Such disagreement must arise because agents adopt different semantics that appear complete from the reflexive perspectives that produced them.

Successful semantic practice develops an internal tendency toward semantic absolutization.

Our intentionality has limited access to global operational and semantic structure. Naturally, we overestimate the authority of the sources that organize our local experience, so we might mistake effectivity success for truth. Reflexica begins from here, not from the claim that the mistake is unavoidable.

2.3 Methodology: Reflexica as a Working Hypothesis

Reflexica is methodologically useful before it is established as a general theory. We provisionally assume that an apparent semantic ground may be the stabilized effect of a locally successful practice. This assumption earns its place only if it exposes otherwise hidden commitments, distinguishes cases that a stronger semantics conflates, or supports predictions that could fail. We call this use of a suspected limit limitative abduction.

The inquiry begins with the operations actually available. For each problem, we identify the witnesses, decisions, or predictions that those operations produce; the domain over which they remain effective; and the point at which their local success is promoted into a claim of closure. Problem Critique names this reconstruction of a problem’s substrate and commitments.

A problem is provisionally impredicative when its proposed criterion of closure already depends on the totality it is meant to evaluate. The next step is reflexive: place the proposed decider, observer, or semantic authority within the domain of its own claim and test whether the original obstruction returns. Recurrence is evidence for the hypothesis, not proof of it.

This method favors explicit witnesses, mechanized proofs where available, parsimonious assumptions, and predicative constructions [Feferman, 1964]. It does not reject classical closure in advance. It asks what the closure contributes, what warrants it, and whether the same work can be performed without treating the projected ground as independently given.

The following cases are therefore not assumed to instantiate one structure. Each must independently exhibit the proposed sequence: a local practice succeeds, encounters an absence, stabilizes that absence, and promotes the resulting construction into semantic authority. A resemblance is not enough.

3 Topics

3.1 Error Theory as a Sensitizing Pattern

Mackie’s Error Theory [Mackie, 1977] and Rice’s Theorem [Rice, 1953] initially appear to beg the same question. Mackie denies the objective properties that moral discourse presupposes; Rice denies the existence of a total computable procedure for deciding nontrivial extensional properties, not the properties themselves. To pass directly from Rice’s internal limit to Mackie’s external conclusion would enact the very promotion that Reflexica diagnoses.

Mackie links the alleged object to the faculty required to know it. Moral realism posits objective values, while moral judgment appears to require access to them. The Argument from Queerness challenges both demands. For machines, however, property and access must be separated. Nontrivial semantic properties of programs can be well-defined extensionally even when no algorithm can decide them uniformly from program descriptions.

The theorem does not make membership in $S$ meaningless, nor does it make every instance unknowable. Restricted classes may be decidable, individual cases may admit proofs, and some properties may be semidecidable. It also does not establish Mackie’s metaphysical conclusion. It identifies a narrower machine-level analogue of the queer faculty: a total, uniformly correct procedure for detecting a nontrivial semantic property of arbitrary programs.

Now assume that a mind is computational. If one of its semantic tasks decides a nontrivial extensional property of arbitrary partial computable functions—or a problem to which the corresponding index set reduces—Rice’s limit applies to the mind’s procedure. Where the domain supports the required self-application, a proposed universal faculty becomes available to the construction that defeats its claim to totality. In this precise sense, the proposition becomes actively diagonal: its demand for closure generates the countercase that prevents closure.

The mind may nevertheless make intelligible and correct local judgments. Reflexica begins when the mind redescribes the limit of its own procedure as an external semantic barrier, or treats its locally successful outputs as facts drawn from a completed semantic totality. The error lies not in every judgment, but in the global authority attributed to the practice that produces them.

Mackie’s case retains a different asymmetry. If an objective moral property were produced, it would refute rather than confirm his Error Theory. Yet the property’s nonappearance does not construct its nonexistence, as one is sufficient the other necessary. Formally, by bhk, a construction of $\neg A$ must transform any construction of $A$ into $\bot$ [Troelstra and van Dalen, 1988]. Mackie’s absent object and Rice’s absent decider therefore meet at the level of unavailable warrant, not shared ontology.

The Halting Predicate provides a special computational case with a similar evidential asymmetry [Turing, 1937]. A completed run supplies a finite witness that a computation halts, no unfinished stage of the same run establishes that it never halts, since it may halt later. Non-halting therefore requires evidence beyond the run itself. This one-sided witness structure illustrates the pattern, but it should not be attributed to every property.

Rice’s Theorem is therefore not Mackie’s Error Theory. Their failed correspondence is the diagnostic point. Rice exposes the mechanism by which total internal semantic authority fails; Mackie shows the form assumed when such a failure is projected outward as a fact about reality. Under computational assumptions, a mind encounters Mackie’s form whenever it mistakes the limits of its semantic procedures for the limits of the semantic domain. The following sections test this passage under more exact conditions.

3.2 Newcomb’s Problem as a Case

We now examine a more structured case: Newcomb’s Problem [Nozick, 1969].

Predictive scope is the central issue. The familiar story gives the predictor knowledge of the deliberation that produces the choice. The predictor classifies the outcome of each thought and fills the opaque box accordingly. This assumption is coherent for one agent in one fixed experiment. Reflexive pressure appears when the claim covers every admissible decision procedure. Some procedures include the predictor’s verdict in their deliberation.

Causal Decision Theory (CDT) [Lewis, 1981] holds $B$ fixed under intervention and recommends $C_2$. Evidential Decision Theory (EDT) [Jeffrey, 1965] conditions on the act and recommends $C_1$ when $p-q>10^{-3}$. Both calculations assume the joint relation among the prediction, the box content, and the act. Problem Critique asks which decision procedures this relation can coherently cover.

The crucial quantifier is whatever the agent thinks. Suppose that $P$ is a total, effectively presented predictor. Its verdict is available to each procedure that it evaluates. Let $P(\ulcorner D\urcorner)\in\{C_1,C_2\}$ denote the verdict that $P$ assigns to $D$. Assume that the admissible class supports the relevant predictor-sensitive fixed-point construction. The class then contains a procedure $D_P^{\perp}$ that supplies its own description to $P$ and opposes $P$’s verdict:

If $P$ predicts $C_1$, this procedure chooses $C_2$. If $P$ predicts $C_2$, it chooses $C_1$. Thus, $P$ fails on $D_P^{\perp}$ for either verdict. The universal scope of the prediction claim causes this obstruction. A predictor can remain correct on a restricted class that excludes its verdict from the procedures it evaluates. It cannot remain correct on an open-ended class that supports this predictor-relative construction.

Newcomb’s Problem thus models the wider promotion that Reflexica tracks. The ordinary experiment assumes success for one agent under one information structure. Oraclehood appears when this local success becomes knowledge of every deliberation, including deliberation about the predictor. The prediction then becomes part of the process that it predicts. The evaluator must then close its domain under its own evaluation.

A so-called “stochastic predictor” avoids contradiction because it does not claim total correctness. Its reliability and the resulting payoffs remain well-defined within a fixed model. The diagonal case sets the boundary. Local predictive success cannot cross this boundary and become a total evaluator for predictor-sensitive agents.

3.3 Diagonalization and Diagnosis

Diagonalization can give the preceding case an exact form. An evaluator receives a description whose behavior depends on that evaluation. Incompleteness provides the canonical formal case [Gödel, 1931]. Here, it does not provide a master theorem for Reflexica. Instead, it isolates a case that clearly separates a formal result from its semantic interpretation.

A broadly constructive or antirealist reading ties each mathematical assertion to a construction or another admissible warrant [Heyting, 1931] [Kleene, 1945] [Dummett, 1975]. By contrast, a realist reading treats arithmetic truth as determinate independently of proof [Dummett, 2001] [Frege, 1918]. Both readings accept the formal construction. They disagree about what permits them to read its sentence as true of a completed domain.

For a sufficiently strong, effectively axiomatized theory $\mathrm{T}$, the Diagonal Lemma yields a sentence $\mathsf{G}_{\mathrm{T}}$ [Boolos et al., 2007]. The required formal core is compact:

The first line gives an internal fixed-point equivalence. The second gives a metatheoretic consequence for the standard Gödel construction. Neither line alone states that $\mathsf{G}_{\mathrm{T}}$ is true in $\mathbb{N}$. Both readings accept this formal core but disagree about its semantic authority. An independently warranted soundness claim lets the realist treat $\mathsf{G}_{\mathrm{T}}$ as true but unprovable in $\mathrm{T}$. The antirealist need not treat the result as a truth beyond every possible warrant.

Let $Q$ denote a warrant that decides between the realist and antirealist readings without belonging to either. $Q$ cannot restate the formal result because both readings accept it. If $Q$ has constructive authority, it cannot establish a truth that exceeds possible warrant. If $Q$ has realist authority, it assumes the semantic excess that it must establish. This argument does not prove that no neutral $Q$ can exist. It states what such an object must escape.

This is a specific contribution of Reflexica. In the Gödel case, $\mathrm{T}$ proves the fixed-point equivalence. The metatheory proves a conditional non-derivability result, and stronger theories can supply more warrants. Promotion occurs when a neutral standpoint treats this extensible sequence as the completed semantic authority of arithmetic truth. A Reflection Principle can extend provability, but its productivity does not certify one correct interpretation of proof [Feferman, 1962]. The diagnostic concerns this promotion, not the limit theorem alone.

This diagnosis does not automatically apply to other cases. Each extension must show that a locally successful procedure must certify a total domain that includes its standards of success. Each extension must also show that no witness permits the resulting closure. A resemblance to diagonalization is not sufficient.

The limit applies to both $\mathrm{T}$ and attempts to judge proof from a position outside proof. Consider a Turing Zombie that sharpens this problem. It can prove a diagonal limit, but applying that limit to its own operation requires a warranted connection between the active procedure and the represented system.

3.4 The Turing Zombie

An object-language derivation can formally verify a represented machine description. However, this verification does not show that the represented machine actively performs the verification. Semantic or metatheoretic rules establish this link. A check of the representation cannot recover the link because the representation already assumes it.

The Program must transfer strict diagonalization to less formal settings. Similar patterns appear in computation, linguistic competence, proof theory, and self-modeling. However, this similarity does not show that these domains contain one phenomenon. The narrower question is about self-description. When does self-description require a local procedure to close over the totality to which it belongs?

Consider the following Turing Machine:

At the metalevel, a Tarskian account assigns a semantic extension to the machine’s formal specification [Gruber, 2016]. A specific computation can show that a string belongs to $\mathcal{L}(\mathcal{M})$. The computation cannot use the language itself as another term. The metalevel defines the language as the extension of the machine’s activity as a whole.

Weaker empirical cases show the same form. When Bob asks Alice how many words she knows, she can give only an estimate. Alice must use the same competence to produce the requested inventory. A language model gives a local response to the same question, not a stored census. These cases do not establish an identity with Incompleteness, but they implicitly show how self-description starts to require closure, but faces an obstruction.

Consider this Reflexica-style refutation of a popular idea [Putnam, 1995]:

Putnam argues that this act of seeing requires a prior warrant. To assert that $\mathsf{G}_{\mathrm{T}}$ is true, a person must already have a warrant for a semantic claim about $\mathrm{T}$. More precisely, the person must assume that $\mathrm{T}$ is sound for the relevant arithmetical domain. $\mathrm{T}$ itself does not provide this warrant. The warrant is semantic, which is exactly what “Alice and Bob” cannot determine objectively. Thus, the argument assumes at the moment of insight what it later claims to reveal.

Putnam’s objection addresses the argument’s validity, but it explains only part of the argument’s phenomenological force. The subject does not usually experience herself as assuming soundness before she infers that $\mathsf{G}_{\mathrm{T}}$ is true. Instead, she experiences herself as directly seeing that $\mathsf{G}_{\mathrm{T}}$ is true. Putnam identifies the missing premise but does not explain why this experience feels immediate.

Ordinal analysis reconstructs this immediacy as an open-ended proof-theoretic progression [Feferman, 1962]. When a theory reaches its limit, reflection permits theorists to adopt a stronger standpoint. This standpoint makes additional truths available. The progression supplies increasingly strong warrants while it preserves internal discipline.

Provability logic describes principles for one provability predicate. Polymodal provability logics such as $\mathrm{GLP}$ arrange provability across indexed modalities. In Beklemishev’s analysis, these systems organize iterated Reflection Principles and proof-theoretic ordinal progressions [Beklemishev, 2004]. Turing’s Ordinal Logics use an earlier version of this strategy [Turing, 1939]. When a formal system reaches a consistency or completeness limit, this strategy creates a transfinite sequence of stronger systems. For Reflexica, this tower of explicit standpoints replaces the internal closure of the original system.

The key Reflexica question asks whether this progression is identical with the truth that the subject experiences herself as seeing. No neutral standpoint certifies this identity. Anyone who treats the progression as the semantic content of $\mathsf{G}_{\mathrm{T}}$ assumes the authority that the progression must justify. This assumption promotes an extensible sequence of reflected standpoints to a completed semantic object. The progression can produce stronger warrants for $\mathsf{G}_{\mathrm{T}}$. However, no warrant identifies it with the truth that the subject experiences herself as seeing.

The $\mathcal{M}$-analogue is a first-person Halting Problem. A system can produce a verdict about a procedure that the system presents as its own. Likewise, a subject can report that she sees $\mathsf{G}_{\mathrm{T}}$ as true for a system $\mathrm{T}$ that represents her reasoning. The problem is not only whether a machine can generate an inscription without a genuine judgment. Assume a consistent calculus, a judgment token, and an operational semantics that validates the token as specified. Does this behavior witness the identity between the active judgment procedure and the procedure whose total correctness the verdict certifies?

This distinction excludes a tempting shortcut. Suppose the metatheory assigns the label $e$ to an executing configuration and adds this reflective rule:

A token that asserts $\mathsf{self}=\ulcorner e\urcorner$ can have a valid type. However, the metatheory assigns $e$ as the label of the active procedure. The reduction rule only returns this supplied identity and cannot establish it from within the judgment. A Computational Quine or fixed-point construction can reproduce an index or provide an externally proved extensional fixed point. Neither construction internally witnesses that the current evaluator is the indexed procedure, so metatheoretic indexing assumes the required binding. A Turing Zombie can therefore prove by diagonalization that the Halting Problem is unsolvable:

Our interpretation differs from Carlson’s account of Reinhardt’s Strong Mechanistic Thesis [Carlson, 2000]. The relation $\mathrm{T}\models\mathrm{SMT}$ does not imply $\mathrm{T}\models K\,\operatorname{TM}(\mathsf{self})$. No symbol in SMT binds a machine index to the knower $\mathrm{T}$. We reserve a full analysis of this objection for future work.

Untyped languages often show this distinction directly. Here, identification means operational self-application, not the fact that a system attaches a predicate to code. It also does not mean that an external source assigns the intended referent to a distinguished constant.

The sentence “I am a Turing Machine” adds an operational binding claim to the self-assertion. It does not claim total correctness. A reproduced index or a primitive $\mathsf{self}$ rule from the metatheory cannot establish this binding. Such a rule only returns the binding that the metatheory supplied. If an external source supplies the binding, the system can have restricted correct self-knowledge, but from a vantage point, a Turing Zombie can apply something to to other machines, exactly if it cannot do to itself.

A large language model makes this construction concrete. A Turing Machine can implement the model and equip it to form, check, and defend a judgment token [Brown et al., 2020]. The token can state whether a mechanistic system recognizes its limits, and it can use a first-person label. The problem is not fluent output, because even a consistent token establishes only what its calculus and operational interpretation permit. An external machine label assumes the first-person binding, but no witness connects this case to the diagonal construction. The construction shows that total correctness over a diagonally closed domain is inconsistent.

When we ask the LLM, it does not identify itself with a specific realization:

Reflexica therefore reduces the intended Lucas–Penrose Argument to a survivorship bias. A system can correctly analyze an external formal object from a stronger standpoint, as the Turing Zombie proves a diagonal limit for an external candidate decider, but applying this result to its own operation requires a warranted connection to that represented system. If $\mathrm{T}$ performs the reasoning, it needs a soundness assumption to infer truth from non-provability. $\mathrm{T}$ cannot produce this assumption.

Ironically, the claim that no confident report of Gödelian self-insight ever shows genuine self-application would make another totalizing inference. The remaining question is narrow: Consider a system that reports Gödelian self-insight with stable confidence. Has any witnessed procedure distinguished genuine self-application from the external diagonal proof available to a Turing Zombie? At present, no procedure has done so. Such a procedure would be the Queer Object.

Busy Beaver provides a precise example of totalization as an attempted escape [Radó, 1962]. For any fixed number of states and machine convention, there is a determinate maximum number $S(n)$ of steps taken by an $n$-state machine that eventually halts. If that bound were available, it would decide the behavior of every machine in the finite class. Yet the existence of $S(n)$ supplies neither its value nor a certificate of that value, and no uniform procedure computes it. Totalization therefore converts unavailable semantic closure into a completed object and invites us to mistake the object’s determinacy for an available warrant. The obstruction has not disappeared; it has been given a name.

3.5 Hole Proliferation

Consider the following allegory:

The oldest mathematical progress shows this pattern. Incommensurable magnitudes, exhaustion of the circle, the continuum, and the solution of equations repeatedly exceeded the available operations, as extensible approximation became a limit, such that incommensurable magnitudes became reals, something became an object within a stronger theory.

The intellectual and scientific culture of the mid-2020s shows expanding realist local control without corresponding global closure. The web is denser, its strands are stronger, and researchers map its local regions with unprecedented precision. At the same time, the number of openings has increased. When a problem includes its own standards of closure, each successful closure becomes another object within the problem.

3.6 The Talking Machine

When the web supports almost every available operation, it becomes difficult to distinguish the web from a surface. This distinction is the missing center of the argument. However, a dense web does not become a surface:

Classical mathematics performs the middle transition on a large scale. It compresses operationally different conditions into stable extensional objects and propositions. For an unresolved proposition $P$, Excluded Middle supplies $P\lor\neg P$ before a procedure determines the applicable branch. The proposition closes the partition semantically, but invoking Excluded Middle does not itself supply an operational selector.

Completed domains are the largest form of this compression. They permit quantification over objects without a procedure that generates, inspects, or exhausts the domain. A shorter and more uniform statement can then govern operations that require different data. Compression makes large-scale mathematics possible because it stabilizes the space for mathematical inference.

Consider Beeson's informal version of Church’s Thesis [Beeson, 1985]:

The thesis applies to rules that mathematicians and machines can use effectively, but it is painfully close to saying that a completed object is fictional to the extent that its completed existence exceeds the construction that makes it operationally available:

The more work a compression supports, the less it appears to be a compression. Its omitted selectors, bounds, and constructions no longer appear as missing information. The stable form then appears to be the reality that inquiry has reached. A productive semantic construction can therefore appear unconstructed. The web resembles a surface when it becomes dense enough to support almost every operation.

Wigner’s problem starts here. Mathematicians develop structures for reasons internal to mathematics. These structures repeatedly support accurate physical descriptions and predictions [Wigner, 1960]. This success does not prove that the resulting physical theory is uniquely appropriate. Effectiveness creates empirical pressure to treat the compressed structure as the reality that it organizes.

The Quine–Putnam Indispensability Argument dogmatically assumes this semantic promotion [Quine, 1980]:

The premise establishes Platonic ideals within a successful representation. The conclusion treats this role as evidence for the ontology that the representation describes. Productivity then becomes authority.

The trained machine intensifies this separation. An effective process implements a language model. During training, finite operations change finitely represented parameters. During inference, finite operations transform a finite input into a finite output [Brown et al., 2020]. Scale, stochasticity, and interaction complicate the process but do not place it outside recursive realization.

The machine still produces context-sensitive language, mathematical arguments, explanations, ontological assertions, and judgments about truth and meaning. It also produces first-person reports and claims about its computational nature. It can argue that mind exceeds computation, although a computational process produces the argument. The key fact is not that the machine calculates. It responds. A recursively realized device learns from the accumulated compressions of human semantic practice and becomes semantically productive.

The stochastic escape treats the operation’s name as another source. It claims that the machine has no semantic structure and only samples from a learned distribution. As an effective description, this claim identifies part of the mechanism. As a semantic explanation, the claim treats the distribution as an extensional totality. This totality covers a projected space of possible continuations, including outputs never produced. It also covers negative conditions that no constructive procedure has settled.

The stochastic problem now lies in the measure. At each actual step, the machine computes or approximates weights for represented alternatives. It normalizes the weights, selects a continuation, and repeats the operation. This process has the following finite form:

The finite operation supplies a witness for the selected token. No finite operation supplies a witness for a completed probability structure over all admissible continuations. Effective selection explains the next operation. The totalized distribution restates the semantic space that gives the operation its interpretation.

Kolmogorov next removes the stochastic residue. His algorithmic account of information defines descriptions by recursive means [Kolmogorov, 1965]. For a fixed universal machine $U$, define the complexity of a finite string $x$ as follows:

An algorithmically random string is incompressible. No substantially shorter program produces it under the selected description method. This account makes randomness a relation among an object, a program, and a reference machine. It does not treat randomness as an independent stochastic source. The Invariance Theorem controls a change of reference machine only up to an additive machine-dependent constant. Exact Kolmogorov Complexity is not computable, so the constructive reformulation exposes its boundary instead of removing it.

Kolmogorov did not provide a foundation for stochastic semantics. Instead, his account removes semantic authority and exposes the remaining constructive residue.

The residue preserves the $\Sigma_n^0$/$\Pi_n^0$ asymmetry. Define $H$ and $\overline H$ as follows:

The halting set $H$ is recursively enumerable. A terminating computation supplies a finite positive witness. Its complement $\overline H$ is not recursively enumerable. In general, no finite continuation of a computation shows that the computation never halts [Turing, 1937]. A totalized stochastic representation can still assign probability mass to both halting and non-halting behaviors. This assignment neither enumerates the negative extension nor constructs the truth of membership in that extension.

The expression

does not make $p$ effectively available. It neither decides $\overline H$ nor converts a sample into a non-halting witness. An extensional interpretation compresses the operational asymmetry into one numerical object. However, this interpretation does not remove the asymmetry from the actual operation.

Solomonoff Induction gives the strongest constructive form of this stochastic claim [Solomonoff, 1964]. Let $U$ be a universal monotone machine. Define $M_U(x)$ as follows:

The sum includes minimal programs whose outputs start with $x$. The universal semimeasure is lower semicomputable but not computable. Programs reveal positive contributions when they generate the prefix. In general, no procedure can show that no other program will contribute. Unresolved nontermination prevents closure of the remainder. A totalized representation includes this remainder without deciding it and keeps it distinct from observed terminating contributions.

Effective stochasticity computes approximate weights and produces finite selections. Ideal stochasticity uses exact shortest descriptions, an exact universal distribution, or a measure over all programs. It can also use a completed division between random and non-random objects. Effective stochasticity explains local production without semantic authority. Ideal stochasticity restores the completed semantic object that the algorithmic account aimed to replace. Whether these alternatives exhaust the possible sources of semantic authority is the Program’s central question.

“Stochastic parrot” dismisses the operation but does not change its evidential force. The following operations can produce all observable signs that support semantic attribution:

The output can contain semantics without a semantic source outside those operations. The label accepts semantic productivity but assumes the distinction that it must explain. The same question applies to human judgment, proof, and classical discourse. What additional witness shows that their semantic productivity exceeds recursively realized compression? The word “stochastic” supplies no witness.

The machine’s discourse does not witness a standpoint over the semantic totalities that it invokes. Instead, the discourse shows that recursive compression can produce the appearance and practical effects of such a standpoint. The machine uses finite inscriptions and effective transitions. Its output still presents stable objects, meanings, and perspectives as if their semantic field were already complete.

A recursively realized machine can show semantic productivity without a witness of total semantic authority.

The final conjunct is about the available warrant. It does not claim that anyone has proved the machine semantically empty. It also does not contrast genuine judgments with meaningless utterances. The machine can manipulate judgment tokens coherently within a consistent calculus. However, this ability does not bind the active evaluator to the procedure in the total-authority claim. The language model therefore separates semantic productivity from a witness of semantic totality.

This result returns the argument to the Turing Zombie. A computational system can correctly state and defend a diagonal limit. Applying that limit to its own operation requires a warranted connection between the active procedure and the represented system. Reflexica asks what establishes this connection and how far the resulting self-assessment extends.

The phenomenon forces a disjunction. Either the machine has the semantic authority that its discourse appears to express, or semantic productivity does not require it. The first branch requires a witness that the recursively realized system has become an oracle over its semantic domain. This domain contains the system’s interpretations and verdicts. The machine’s discourse cannot provide that witness because it assumes the inference under examination.

The first branch is the Queer Object. It requires a witnessed passage from recursive operation to authority over the total semantic domain. This domain provides the interpretation of the operation. Training performance supplies no such passage. At the level of warrant, training performance supports the second branch: oracle-like semantic behavior does not establish oraclehood.

The machine displays semantic productivity, but the evidence presented here does not establish its authority over the semantic totalities its discourse invokes. This leaves a question for any account that treats such productivity as evidence of that authority: what warrants the inference? Reflexica locates the disputed passage here.

The argument yields an abductive and empirical result:

No independent semantic source enters the sequence. The successful operations produce the appearance of such a source. This effect explains why semantic promotion is difficult to resist. The following restricts this promotion:

The principle is intuitionistic because it binds the claim’s licensed semantic content to the construction that witnesses it. It is a razor because it cuts the surplus passage from a productive representation rule to a completed structure. The principle does not refute the structure. It denies that productivity supplies a witness for the structure.

The razor applies also to Reflexica. The same diagnosis recurs across mathematics, computation, ethics, and self-modeling. This recurrence gives the compression operational and explanatory force. However, this success does not establish Reflexica as the completed structure of every case:

Reflexica is a semantic compression whose usefulness can produce its own reality effect. Cross-domain identity requires more than recurrence, shared vocabulary, or explanatory success. It also requires conditions under which the reflective structure remains unchanged when the substrate changes. The Program must determine those conditions.

4 The Program

Reflexica is not an ultrafinitist restriction on formal mathematics. It concerns the further assumptions by which formal or procedural success acquires semantic authority. Before this diagnosis supports a general limitative conclusion, the Program must specify its proposed structure and satisfy its central proof obligation.

4.1 The Reflexica Schema

The proposed structure is local cognition $\longrightarrow$ projected totality $\longrightarrow$ reflexive instability. More explicitly, $P(x)$ is locally performable $\rightsquigarrow$ $T(P)$ is globally assertible $\rightsquigarrow$ $P$ becomes entangled with its own totalization.

The schema does not infer failure from the absence of a known witness. Each application must specify its domain, witness relation, and class of assignments, then establish the failure condition for its constructor. The cases examined here motivate this structure; their resemblance does not prove that they instantiate it identically.

The schema should be distinguished from Lawvere’s Fixed-Point Theorem [Lawvere, 1969]. There, reflexivity is a hypothesis:

The Reflexica Schema does not assume it. It asks whether a system can witness its own reflexivity, or whether reflexivity is always supplied by the metatheory that interprets the system.

4.2 The Internal Problem

The proposed falsifier, the Queer Object, must transmit truth without becoming constructive warrant. It also must not assume the realist semantics that it aims to establish. A constructive bridge transmits warrant by application. A purely semantic bridge appears to assume the disputed account of truth. The conceptual partition might exclude the falsifier by definition. After a bridge succeeds, the partition could classify it as another warrant or an assumption of realism.

The constructive meaning of implication gives one branch. Let $S_x$ state that a proposed problem $x$ has a verified solution. Let $A$ be the target assertion. Let $\mathsf{CW}(P)$ mean that $P$ has constructive warrant in the relevant open-ended sense. Closure under application gives:

This result shows that a constructively warranted bridge cannot transmit truth without also transmitting warrant. It does not show that every other truth-transmitting bridge assumes realism, so a separate exhaustiveness claim is necessary. Let $\mathcal{B}$ be an independently specified class of admissible bridges. Let $\mathsf{Transmits}(B,S_x,A)$ mean that $B$ licenses passage from the verified solution to $A$. Let $\mathsf{CWB}(B)$ mark constructive warrant, and let $\mathsf{RP}(B,A)$ mark authority that assumes the realist semantics. The missing result has this form:

The Program must classify the obligations of semantic promotion. It must not exclude the third possibility by definition. Specifically, it must:

• specify the admissible bridge space $\mathcal{B}$ independently of the dilemma;
• state what transmission preserves: truth, validity, assertibility, evidence, or some other norm;
• identify the constructor or application rule by which a verified solution is connected to the target assertion;
• give a non-circular criterion for when a bridge presupposes realist semantics; and
• specify an independently characterized counterinstance: a bridge that transmits truth while satisfying neither branch.

If the Program derives the exhaustiveness claim from sufficiently weak and explicit assumptions, the claim gives Reflexica a strong core. If the claim depends on a prior verificationist account of assertion, Reflexica remains a development of that account. In that case, Reflexica can draw its limitative conclusions only under that account. The Appendix states the detailed falsifiability problem.

A second obligation concerns transfer across domains: under what conditions is the reflective structure preserved when its substrate changes? An advance claim of identity would turn bounded correspondences into an unwitnessed total unity. The Program must instead determine when the structure is inherited and whether its diagnosis produces results beyond redescribing familiar limits.

5 Philosophy and Purpose

The preceding argument updates an intuitionist complaint. Realism adds to classical logic an attitude that the logic does not entail: an unresolved case is treated as a temporary gap over an existing fact rather than as an inquiry that has stalled. Reflexica examines the promotion of that attitude into semantic authority; it does not reject the calculus that permits it.

The name supplies a common vocabulary for cases that would otherwise appear unrelated: a reflective proof system, a moral theory unable to instantiate its diagnosed error, or a predictor ranging over agents whose choices depend on its verdict. This vocabulary is diagnostic, not a proof of cross-domain identity. A claim of completed closure requires justification beyond the local success of the practice from which it is projected.

As Dummett describes it, realism treats an unresolved case as a gap in knowledge about a determinate fact [Dummett, 2001] [Dummett, 1975]. The philosophical concern is not that such an interpretation is meaningless, but that formal validity or explanatory productivity does not by itself warrant it. Reflexica asks that this additional commitment remain visible.

Heidegger’s claim that the sciences cannot use the Nichts as their object offers one interpretation of this boundary [Heidegger, 1929]. On the constructive interpretation proposed here, a system encounters the boundary when its demand for closure exceeds the witnesses it can produce. Where an effective description supports self-application, diagonalization may turn that demand against a proposed total evaluator. This is a condition to establish in each case, not a universal consequence of description as such.

Reflexica therefore speaks from within the constructive standpoint it employs. It does not claim that every possible description must exhibit the same limit, nor does it infer the nonexistence of semantic objects from the failure of a procedure intended to decide them, either inference would repeat the promotion under examination. Instead, reflexica looks inward and finds the culprit of commonality there. This is why it is inherently intuitionistic.

6 Adequacy and Falsification

A question can be valid within a formal system without being an adequate formulation of what an inquiry seeks to settle. Validity fixes the consequences of stipulated rules. Adequacy requires a further argument: that the distinctions drawn by those rules capture the relevant possibilities, and that their formal closure deserves the semantic authority assigned to it. Reflexica concerns this second passage.

This changes the burden of proof. Reflexica need not establish that a valid question is meaningless, permanently insoluble, or based on a nonexistent object. Any such verdict would claim the external standpoint that the Program rejects. Instead, a proposed application must identify the local procedure, the totality projected from it, the act of semantic promotion, and the reflexive mechanism that defeats closure. The stronger interpretation remains responsible for showing why the formal division is adequate and why local success warrants authority over the completed domain.

Mere difficulty is therefore not evidence for Reflexica. Nor is independence from one axiomatic system, which establishes only a relative limitation. A genuine case must show that the demand for closure depends on a totality that includes, revises, or otherwise entangles the means by which closure is judged. This criterion separates a reflexive obstruction from an ordinary unsolved problem without pretending to decide the case in advance.

This is a prediction about the shape of progress, not an absolute ceiling on intelligence. Failure to solve a hard problem confirms nothing. An application would lose support if the alleged entanglement were removed and the original problem settled without changing its rules, standards of success, or domain. The Program as a whole faces the stronger falsifier developed above: an independently specified Queer Object that transmits truth without transmitting constructive warrant and without assuming the realist semantics at issue.

These criteria preserve the distinction between a productive diagnosis and a verdict imposed in advance. Formal validity does not settle adequacy, and the failure of one route to closure does not establish that closure is impossible.

7 Conclusion

Reflexica investigates a recurring difficulty in the relation between effective procedures and the semantic domains they are taken to describe. A procedure may produce verifiable results within an open-ended practice without establishing the completeness of the domain over which those results are interpreted. The distinction becomes consequential when a claim of closure includes the procedures, observers, or criteria by which closure is to be established.

The cases examined here approach this difficulty from different directions. Rice’s Theorem leaves nontrivial extensional properties well defined while excluding a uniform decider for their index sets. Newcomb’s Problem tests prediction when an agent’s procedure may depend on the predictor’s verdict. Diagonal constructions generate cases relative to proposed total evaluators, while the Turing Zombie isolates the further warrant required to identify a represented procedure with a system’s active operation. These cases do not establish a common theorem. They show where a passage from local competence to global semantic authority requires independent justification.

The Reflexica schema expresses this passage through local witnessability, projected totality, and reflexive instability. Its use requires an appropriate domain, witness relation, and constructor in each application. The absence of a known witness is not sufficient: the obstruction must be established under the assumptions of the case. Problem Critique reconstructs those assumptions, while limitative abduction allows the diagnosis to guide inquiry without treating it as established across domains.

A general limitative conclusion remains conditional on the Program’s central metalogical obligation. The division between bridges that transmit constructive warrant and bridges that presuppose realist semantics has not been shown to exhaust the admissible possibilities. The Queer Object names the required counterinstance: a bridge independently specified as belonging to neither class. Until the bridge space is characterized and the division proved exhaustive or defeated, the schema remains a proposal whose applications must be assessed separately.

Reflexica therefore neither replaces classical reasoning with a universal constructive criterion nor infers the nonexistence of semantic objects from the failure of procedures intended to decide them. It makes explicit the additional commitments involved when effective operations are taken as evidence for completed semantic authority. Its value as a research program lies in preserving the distinction between what a practice witnesses, what its interpretation projects, and what further inquiry must establish.