Relativized Diagonal Non-Computation

• Relativized diagonal non-computation is a framework that studies functions avoiding diagonal values relative to parameters like oracle sets, computable orders, or subrecursive bounds.
• The approach refines classical diagonalization by introducing bounded variants such as DNR_h and by applying these concepts in reverse mathematics, forcing, and degree-theoretic constructions.
• Its implications span computability theory, algebraic logic, and resource-bounded models, offering insights into axiomatic foundations, non-definability, and incompressibility.

Searching arXiv for recent and foundational papers on relativized diagonal non-computation and related oracle/axiomatic frameworks. Relativized diagonal non-computation denotes a family of constructions in which diagonal avoidance, undecidability, or non-definability is studied relative to an added parameter: an oracle set, a growth bound, a subrecursive machine, or a relativized semantics. In computability theory, the standard instance is a function $f$ that is diagonally non-computable relative to $X$, meaning $f(e)\neq \Phi_e^X(e)$ for every index $e$ whenever $\Phi_e^X(e)\downarrow$; in reverse mathematics this yields principles such as $\mathrm{DNR}_h$; and in algebraic logic related phenomena appear through diagonal-free relativized semantics. The papers considered here also include axiomatic accounts of why diagonal arguments relativize, subrecursive analogues of Busy Beaver and halting-probability constructions, and several nonstandard reinterpretations of the scope of diagonalization (Patey, 2014, Shen, 2018, Banerjee et al., 2018, Abrahão, 2016, Sung, 6 Mar 2026).

1. Oracle-relative diagonal non-computability

A function is diagonally non-computable relative to a set $X$ if it avoids the diagonal values of the universal partial computable functions with oracle $X$. Formally, if $\Phi_e^X$ is an effective enumeration of the partial computable functionals, then $f$ is d.n.c. relative to $X$0 if for every index $X$1,

$X$2

In the unrelativized notation based on a universal partial computable function $X$3, one writes $X$4 for all $X$5 whenever $X$6. This is the canonical computability-theoretic form of diagonal non-computation: the function $X$7 “diagonalizes” against the $X$8-th program on its own index (Patey, 2014).

Several bounded versions refine this notion. In one formulation, a function $X$9 is $f(e)\neq \Phi_e^X(e)$0-bounded if $f(e)\neq \Phi_e^X(e)$1 for all $f(e)\neq \Phi_e^X(e)$2, and $f(e)\neq \Phi_e^X(e)$3 asserts that for every set $f(e)\neq \Phi_e^X(e)$4 there exists an $f(e)\neq \Phi_e^X(e)$5-bounded function d.n.c. relative to $f(e)\neq \Phi_e^X(e)$6, with $f(e)\neq \Phi_e^X(e)$7 a computable order, namely nondecreasing and unbounded (Patey, 2014). In another formulation, the class

$f(e)\neq \Phi_e^X(e)$8

and its relativized analogue

$f(e)\neq \Phi_e^X(e)$9

are used to study measure-theoretic and degree-theoretic behavior (Bienvenu et al., 2014). For computable $e$0, the negligibility threshold is explicit: $e$1 This gives a quantitative refinement of diagonal non-computation in terms of growth rates rather than mere existence (Bienvenu et al., 2014).

The same notion appears in reverse mathematics with $e$2-boundedness. If $e$3 is $e$4-bounded when $e$5, then $e$6 means that $e$7 is both $e$8-bounded and diagonally non-recursive relative to $e$9, that is,

$\Phi_e^X(e)\downarrow$0

This formulation is central when the strength of diagonal principles is compared to weak König’s lemma and to induction schemes (Dorais et al., 2014).

2. Reverse mathematics, forcing, and degree-theoretic structure

The bounded hierarchy of relativized diagonal non-computation has been used to separate principles in reverse mathematics. For every computable order $\Phi_e^X(e)\downarrow$1, there exists an $\Phi_e^X(e)\downarrow$2-model of $\Phi_e^X(e)\downarrow$3 that is not a model of $\Phi_e^X(e)\downarrow$4, and therefore not a model of $\Phi_e^X(e)\downarrow$5. The proof combines bushy tree forcing with the Lerman–Solomon–Towsner framework for transforming a computable non-reducibility into a separation over $\Phi_e^X(e)\downarrow$6-models. Its forcing conditions are pairs $\Phi_e^X(e)\downarrow$7, with $\Phi_e^X(e)\downarrow$8 a “bad” set controlled through $\Phi_e^X(e)\downarrow$9-bushy trees, $\mathrm{DNR}_h$0-big and $\mathrm{DNR}_h$1-small sets, smallness closure, concatenation, and smallness additivity; the iterated construction then builds a Turing ideal closed under $\mathrm{DNR}_h$2 while preserving a computable locally $\mathrm{DNR}_h$3-colorable graph $\mathrm{DNR}_h$4 with no solution in the ideal (Patey, 2014).

A distinct line of work calibrates the dependence of these reductions on induction. Over $\mathrm{DNR}_h$5, for each fixed $\mathrm{DNR}_h$6, $\mathrm{DNR}_h$7 is equivalent to $\mathrm{DNR}_h$8, and also to $\mathrm{DNR}_h$9. By contrast, over $X$0,

$X$1

and the finer strict hierarchy

$X$2

holds over the same base. The paper further states a recursion-theoretic corollary: if a model satisfies $X$3 but not $X$4, then there exists some nonstandard $X$5 and a $X$6-bounded DNR function that computes no $X$7-bounded DNR function. In this account, $X$8-induction is the exact missing ingredient for the classical reduction from $X$9-bounded to $X$0-bounded DNR to work uniformly (Dorais et al., 2014).

Relativized DNC also organizes degree-theoretic constructions. There is an increasing $X$1-sequence $X$2 of Turing degrees forming an initial segment of the Turing degrees such that each $X$3 is diagonally noncomputable relative to $X$4. The proof iterates bushy-tree forcing through a hierarchy of forcing notions $X$5 and coherent restriction maps, ensuring that each extension is a strong minimal cover of the preceding degree. The resulting corollary is that the reverse-mathematical principle $X$6 does not imply the existence of Turing incomparable degrees (Cai et al., 2015).

Measure-theoretic refinements show that relativized diagonal non-computation is not confined to rare degree phenomena. For every sufficiently fast-growing computable $X$7, every $X$8-random real computes some $X$9 which does not compute any Martin-Löf random real; more strongly, for any real $\Phi_e^X$0 and sufficiently fast-growing computable $\Phi_e^X$1, every real $\Phi_e^X$2 that is both $\Phi_e^X$3-random and $\Phi_e^X$4-random computes a function $\Phi_e^X$5 which itself computes no Martin-Löf random real. The proofs combine Kautz-style “fireworks” arguments with bushy tree forcing inside the $\Phi_e^X$6-bushy tree

$\Phi_e^X$7

using the DNC-bad set

$\Phi_e^X$8

and a measure estimate that turns bushy-tree smallness into positive probability of avoiding bad strings (Bienvenu et al., 2014).

3. Axiomatic explanations of relativization

An axiomatic account of relativized computability isolates the exact structural ingredients under which diagonal and non-computability arguments relativize. Let $\Phi_e^X$9 be a class of partial functions with natural-number arguments and values. The first axiom requires that $f$0 contain all partial recursive functions and be closed under substitution, primitive recursion, and the $f$1-operator. The second axiom, the computation-record axiom, says that for every unary $f$2 there exist a set $f$3 and functions $f$4 whose domains contain $f$5, such that the characteristic function of $f$6 belongs to $f$7 and $f$8 iff there exists $f$9 with $X$00 and $X$01. The third axiom is a programs axiom: there exists a binary universal function $X$02 such that for every unary $X$03 there is some code $X$04 with $X$05 (Shen, 2018).

The main theorem states that if $X$06 satisfies conditions 1–3, then there exists a set $X$07 such that $X$08 is exactly the class of all partial functions partial recursive relative to $X$09. Equivalently,

$X$10

The proof develops $X$11-enumerable and $X$12-decidable sets, shows that domains, ranges, and graphs of $X$13-functions are $X$14-enumerable, introduces $X$15-enumeration reducibility, and proves that if a set is $X$16-enumeration reducible to a $X$17-enumerable set, then it is $X$18-enumerable. It then shows, first, that a partial function belongs to $X$19 iff it is partial recursive relative to the universal function $X$20, and, second, that the relevant oracle can be coded by a set $X$21 so that enumeration reducibility to $X$22 is equivalent to recursive enumerability relative to $X$23 (Shen, 2018).

Within this framework, relativized diagonal non-computation is not a separate phenomenon but a consequence of the same closure, universality, and enumeration machinery used in the unrelativized setting. The paper explicitly identifies standard results such as the non-existence of a total decider for the halting problem relative to $X$24, relativized versions of the recursion theorem, and relativized diagonal non-computation statements as results whose proofs go through because they depend only on these axioms. This suggests that the persistence of oracle-relative diagonal arguments is explained structurally rather than by case-by-case simulation (Shen, 2018).

4. Subrecursive relativization and relative incompressibility

A different relativization program internalizes diagonal non-computation inside total, time-bounded subsystems of a universal machine. A Turing submachine is defined from a total program $X$25 by

$X$26

and a time-bounded submachine $X$27 is obtained when $X$28 computes a total time bound. A concrete construction uses a program $X$29 that returns a default value if $X$30 does not halt within time $X$31, and otherwise shifts the output label by one; this yields

$X$32

Because $X$33 is total, $X$34 is total. The paper then defines the Busy Beaver Plus function relative to a submachine $X$35 by

$X$36

so the output is strictly above the value of every program of size at most $X$37 running on that same submachine (Abrahão, 2016).

The corresponding relative halting probability is a time-bounded analogue of Chaitin’s $X$38: $X$39 The paper introduces a self-referential submachine $X$40 and proves that if $X$41 is total, then $X$42 is well-defined for every $X$43; hence $X$44 is itself a Turing submachine. It then proves that for every natural number $X$45 there exists a program of the form

$X$46

whose output on $X$47 is at least $X$48, with program length bounded by $X$49 for some constant $X$50. This is the submachine-relative analogue of the theorem that sufficiently informative approximations to $X$51 determine Busy Beaver values (Abrahão, 2016).

The principal incomputability statement is that for any total $X$52, the function $X$53 is uncomputable by any program running on $X$54. The paper states this as a strict dominance condition: for every program $X$55, there exists $X$56 such that for all $X$57,

$X$58

and similarly with $X$59. Since no program of size $X$60 can output a value $X$61, the function is also relatively incompressible on that submachine. Here relativized diagonal non-computation is the claim that a function may be computable in the ambient universal machine while remaining uncomputable and incompressible relative to the submachine that serves as the local computational universe (Abrahão, 2016).

5. Diagonal-free relativized semantics and non-definability

In algebraic logic, related phenomena arise when diagonal elements are removed and semantics are relativized. For any ordinal $X$62, the class $X$63 consists of representable relativized diagonal-free set algebras of dimension $X$64, built from structures

$X$65

where $X$66 is nonempty and

$X$67

Because there are no diagonal elements $X$68, equality is absent from the logic. The paper proves that the representable relativized class coincides with its equational axiomatization $X$69, that if $X$70 then the free algebra $X$71 is atomless, and that in any free algebra the only zero-dimensional elements are $X$72 and $X$73. Its logical conclusion is that in first-order logic without equality on relativized semantics there is no finitely axiomatizable, complete and consistent theory (Banerjee et al., 2018).

The same paper explicitly presents this as a kind of relativized diagonal non-computation or non-definability. The absence of diagonals means that equality-like information cannot be recovered by the algebraic operations, and the triviality of zero-dimensional elements means that there are no nontrivial variable-independent propositions. The logical translation uses general assignment models $X$74, with $X$75 nonempty and quantifiers interpreted relative to $X$76, and yields finite schema axiomatizability, the finite model property, decidable validities, Craig interpolation, and Beth definability, while still excluding finitely axiomatizable complete consistent theories (Banerjee et al., 2018).

A broader blow-up-and-blur program connects these diagonal-free and relativized constructions to failures of omitting types. For finite $X$77, any class between $X$78 and $X$79 is not atom canonical, and any class containing the class of completely representable algebras and contained in $X$80 is not elementary. The paper proves that there is no finite variable universal axiomatization of several representable diagonal-free reducts of cylindric algebras of dimension $X$81, and that the omitting types theorem fails for finite variable fragments of first-order logic with and without equality even when severely relativized models are allowed. A central logical formulation is that there exists a countable consistent $X$82-theory with a non-principal type that cannot be omitted in any $X$83-flat model (Ahmed, 2014). In this part of the literature, relativized diagonal non-computation becomes a problem of what cannot be defined, represented, or omitted once equality and full-square semantics are removed.

6. Reinterpretations, resource-bounded variants, and barrier claims

Some papers reinterpret the force of diagonal arguments rather than accepting the standard non-computability reading. One paper argues that reflexive and diagonal proofs of limitative theorems are being over-interpreted. It proposes an axiom schema

$X$84

where $X$85 is the sentence “the sentence on the left of this conjunction is true,” and presents this as a “reflexivity blocker.” It also proposes a “large tester” $X$86 intended to avoid the standard halting contradiction by running in parallel with a tester $X$87, and advances the formal thesis that “there exists a finite algorithm capable of computing all real numbers (and or binary strings) with an arbitrary precision (exactly in limit).” The core algorithm $X$88 generates all finite binary strings stage by stage on a binary tree, and the paper argues that the diagonal argument “does not apply because obtained matrices are rectangular and complete.” The same work does not develop relativization in the standard complexity-theoretic sense, but it explicitly gestures toward a framework in which diagonal non-computation is blocked by additional structure internal to the system (Młynarski, 2011).

A resource-bounded reformulation treats diagonal obstruction as a failure of bounded self-certification. In this framework, if a machine $X$89 correctly decides whether $X$90 halts within $X$91 steps, then $X$92 requires at least $X$93 steps. The paper turns this $X$94 overhead into an operator $X$95 on a domain $X$96 of partial halting observations, proves that $X$97 is monotone and Scott-continuous, and defines an ascending chain

$X$98

whose Scott supremum is

$X$99

No bounded observation is a fixed point, but the least fixed point exists at the $f(e)\neq \Phi_e^X(e)$00-limit. The paper explicitly states that it does not develop a formal oracle-relative theory, yet it suggests an analogy: relative to a finite bound $f(e)\neq \Phi_e^X(e)$01, the machine cannot decide its own halting, whereas relative to the $f(e)\neq \Phi_e^X(e)$02-limit of iterated self-observation, the fixed point is obtained (Sung, 6 Mar 2026).

In oracle complexity theory, another line of work relocates the obstacle to diagonalization from self-reference to enumerability. In the Baker–Gill–Solovay setting, the papers claim that diagonalization requires three prerequisites: effective representation of oracle machines as strings, existence of a universal nondeterministic oracle machine that can simulate deterministic oracle machines and flip their answers, and bounded simulation overhead of order $f(e)\neq \Phi_e^X(e)$03. On this basis they argue that if

$f(e)\neq \Phi_e^X(e)$04

then the set $f(e)\neq \Phi_e^X(e)$05 of polynomial-time deterministic oracle Turing machines with oracle $f(e)\neq \Phi_e^X(e)$06 is not enumerable; therefore a Cantor- or Turing-style diagonalization over $f(e)\neq \Phi_e^X(e)$07 cannot be carried out (Lin, 2021, Lin, 2021). This yields a diagnosis of the relativization barrier that differs sharply from the axiomatic account of relativized computability: rather than explaining why diagonal arguments survive oracle extension, it treats non-enumerability of the target class as the reason a universal-machine diagonal construction does not go through in that setting (Shen, 2018).

Across these lines of work, “relativized diagonal non-computation” names not one theorem but a cluster of precise technical programs. In the oracle-DNC tradition it concerns functions avoiding $f(e)\neq \Phi_e^X(e)$08; in reverse mathematics it calibrates the strength of existence principles such as $f(e)\neq \Phi_e^X(e)$09; in axiomatic recursion theory it is explained by closure, computation records, and universality; in subrecursive settings it becomes relative incomputability and incompressibility against a local machine universe; and in diagonal-free algebraic logic it appears as a failure of definability, atomicity, and omitting types under relativized semantics. The more revisionary papers preserve the vocabulary of diagonalization while revising either its interpretation or its prerequisites, especially through limit computation, self-certification at the $f(e)\neq \Phi_e^X(e)$10-stage, or oracle-dependent claims about enumerability (Młynarski, 2011, Sung, 6 Mar 2026, Lin, 2021).