Pith. sign in

REVIEW 3 major objections 4 minor 8 references

Paradoxes Are Not Contradictions: Re-examining the Third Mathematical Crisis

T0 review · 3 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper argues that self-referential paradoxes are logically valid Möbius-strip structures, not contradictions, and that the classical halting-problem proof therefore does not rule out universal termination deciders.

desk verdict The central claim fails because A→¬A and ¬A→A jointly entail A∧¬A, so the paper's own definition of 'paradox' is a textbook contradiction; the alleged flaw in Turing's proof is a misunderstanding of reductio. read the letter →

arxiv 2607.17306 v1 pith:O3GURNKH submitted 2026-07-19 math.LO

H. Y. Yuan This is my paper · ORCID
classification math.LO MSC 03A0503B0503B5003D10
keywords paradoxself-referencenegationMöbiusstriphaltingproblemundecidabilitythree-valuedlogiccompleteness
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that self-referential paradoxes—the set of all sets that do not contain themselves, the sentence that says it is false, the program that calls its own termination checker—are not contradictions but valid logical structures. On that view, a paradox is a Möbius-strip-like loop in which each of two opposite truth values implies the other, and because the two values never appear together, the consistency principle is not violated. The paper applies this to the classical halting-problem proof and claims the proof only constructs a paradox, so it does not justify rejecting the assumption that a universal termination decider exists. It further argues that after excluding such self-referential paradoxes from the domain, a halting decider is still possible, and that this reinterpretation applies to any program that predicts the output of other programs. A sympathetic reader would care because, if correct, the claim would reopen a foundational negative result of computer science and change how undecidability proofs are read.

What carries the argument

The central device is the two-way implication A→B and B→A between opposite truth values of the same proposition, which the paper defines as a paradox; for three-valued logic it is extended to a cyclic triple A→B, B→C, C→A. The Möbius strip supplies the working image: a loop with a half-twist has one continuous surface, so opposite sides become a single side, just as the two opposite valuations of a paradox are unified by self-reference and negation. This machinery carries the argument by reclassifying the apparent contradiction in the halting proof as a legitimate structure and then reinterpreting the quantifier 'all programs' to exclude such structures.

What would settle it

Take A and B to be 'the program halts' and 'the program does not halt.' Write the two implications as (A→B) and (B→A) with B = ¬A. A plain truth table for (A→¬A) ∧ (¬A→A) shows no assignment of true or false to A satisfies it, because the formula reduces to A ∧ ¬A. That computation directly settles whether the paper's key move—claiming the two implications create no contradiction—holds in ordinary two-valued logic.

Watch

Extended reading notes

Core claim

The paper's central claim is that a paradox is not a contradiction but a self-consistent structure defined by two or more opposite truth valuations of one proposition that imply each other in a cycle. In the two-valued case the structure is A→B and B→A; in the three-valued case it is A→B, B→C, C→A. Because the valuations are never true together, the author holds that no violation of consistency occurs; the structure is a logical Möbius strip uniting opposing surfaces. In the halting-problem argument, the constructed program B(B) produces exactly such a cycle, so the derivation 'if it halts then it loops, if it loops then it halts' is declared a valid paradox rather than a refutation. Therefo

Load-bearing premise

The load-bearing premise is that A implies B and B implies A, where B is 'not A,' can hold in classical logic without forcing A and 'not A' to be true together; in standard propositional logic, (A→¬A)∧(¬A→A) is equivalent to A∧¬A, so the claimed consistency rests on a non-classical view of implication that the paper does not formalize.

Editorial extensions

If this is right

  • If the paper's argument is correct, the classical halting-problem proof does not prove undecidability, and a universal termination decider might exist once self-referential paradoxes are excluded.
  • The same construction yields a paradoxical counterexample for any procedure that predicts program outputs, so the claimed flaw extends beyond termination to all output-prediction tasks.
  • Completeness of a formal system is only meaningful after paradoxical objects are factored out, which the author says is what working mathematical practice already does.
  • Paradoxes themselves are undecidable: they are not a third truth value, and assigning true or false to 'this sentence is false is a paradox' leads to the same cyclic contradiction.
  • The Möbius perspective can be applied to real-world opposition, with wave-particle duality of light proposed as a paradox of wave and particle states rather than either one alone.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • This reader's inference: the paper leaves open what 'excluding paradoxical programs' means as a formal restriction; a testable extension would be to construct an explicit decider for a defined class of programs that provably contains no self-referential calls to the decider.
  • A neighbouring consequence the author does not spell out: if the same Möbius reading is applied to the incompleteness theorems, undecidable sentences would be reinterpreted as paradoxes rather than limits, which would change the standard interpretation of incompleteness but is not established by this paper.
  • A testable check for the three-valued extension: specifying a concrete three-valued truth table that satisfies the cyclic implications without collapsing would demonstrate that such paradoxes can live inside many-valued logic; the paper does not supply one.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper proposes that paradoxes, defined as mutual derivability A→B and B→A between opposite truth valuations of the same proposition, are not contradictions but form a consistent 'Möbius strip' logical structure. On this basis it claims that Turing's halting problem proof is flawed because the contradiction it derives is really a paradox, so a universal halting decider is not ruled out once 'paradoxical programs' are excluded. It further discusses three-valued analogues and attempts to prove that paradoxes are undecidable, and concludes with philosophical remarks on wave-particle duality.

Significance. If the central claim were correct, it would challenge a foundational result in mathematical logic and computability theory. The paper is clearly written and attempts to give formal definitions, but the central argument rests on a non-classical treatment of implication that is neither justified nor internally consistent. No machine-checked proofs or reproducible artifacts are provided, and the paper does not engage with the standard formalization of the halting problem as a theorem of classical first-order logic. The significance is therefore conditional on a correction of the core logical error, which the manuscript does not supply.

major comments (3)
  1. [§2.1, Case (3) and Definition 1] The load-bearing claim that 'A and B never hold simultaneously' is false in the formal sense. If A and B are a contradictory pair, i.e. B = ¬A, then A→B is A→¬A, which entails ¬A; B→A is ¬A→A, which entails A. Both implications hold simultaneously, so both A and ¬A are derivable. This is exactly A∧¬A, a contradiction. The mutual implication is a conjunction of two implications, not a choice between alternative suppositions. Thus Case (3) does not define a third logical category; it collapses into classical contradiction.
  2. [§3, Halting problem discussion] The paper's critique of Turing's proof is a non sequitur. In the halting problem proof, the program B is an ordinary, well-defined Turing machine constructed from the assumed decider T. From the assumption that T decides halting for all programs, one derives both B(B) halts and B(B) does not halt. Classical reductio ad absurdum correctly rejects the assumption. The paper's proposal to 'exclude paradoxical programs' from the universal quantifier changes the meaning of 'all programs' after the fact and provides no independent characterization of the excluded class. The constructed B is not a new kind of object; it is a standard program, so the theorem stands.
  3. [§4, Undecidability of paradoxes] The proof that 'the paradox of S1 and S2' cannot be a set, and analogously that a paradox is not a truth valuation, assumes the very point at issue. It uses ordinary two-valued classical reasoning to derive a conclusion about paradoxes while simultaneously claiming paradoxes are valid structures outside classical truth assignment. The derivation system in Eq. (3) is presented as if it shows a new kind of undecidability, but without a non-classical semantics the steps S3∈S3 → S3∈S1 → S3∈S2 → S3∈S3 are just a cycle of implications. No formal definition of 'belongs to a paradox' is given, so the inference from that cycle to the claimed contradiction is unsupported.
minor comments (4)
  1. [§3, Notation] The program B and the proposition B are denoted by the same symbol, which is confusing. The paper should distinguish the program name from the proposition 'the program halts'.
  2. [Figure 1] The figure is referenced but not included in the text; the three cases are described in prose but a diagram would help.
  3. [§2.2, Möbius analogy] The Möbius strip analogy is evocative but does not constitute a logical argument. The leap from a geometric surface to derivability relations needs a precise formal semantics.
  4. [References] The reference list is sparse for a paper claiming to address the third mathematical crisis; standard works on Gödel's theorems and the halting problem are cited only indirectly.

Circularity Check

2 steps flagged · score 8.0 of 10

Central conclusion is definitional: 'paradox' is defined as A→B/B→A and asserted non-contradictory, then Turing's diagonal contradiction is relabeled 'paradox' and excluded from 'all programs'.

  1. self definitional [§2.1, Definition of Paradox and Fig. 1 case (3)]
    "Notably, A and B never hold simultaneously, which implies no violation of the consistency principle and the absence of genuine logical contradiction. Accordingly, paradoxes are logically valid constructions."

    The paper defines 'Paradox' (Definition 1) merely as A→B and B→A, and then asserts that A and B 'never hold simultaneously'. This non-simultaneity is not derived; it is smuggled into the definition of a paradox as a self-consistent structure. When B is the negation of A, the two implications are simultaneous rules: A→¬A yields ¬A and ¬A→A yields A, so both truth values are forced. The conclusion that paradoxes are not contradictions thus follows only because the definition already stipulates that the mutual-derivation structure is non-contradictory. The later application to the halting problem inherits this circularity: Turing's A→B and B→A are declared to 'satisfy the definition of a paradox', so the contradiction is reclassified by definition rather than analyzed.

  2. renaming known result [§3, 'Paradoxes and the halting problem']
    "The proof establishes A→B and B→A , which satisfies the definition of a paradox provided earlier. Nevertheless, Chapter 2 rigorously demonstrates that a paradox represents a logically valid structure rather than a genuine contradiction. Accordingly, the premise assuming the existence of a universal halting decider cannot be rejected merely to eliminate the emergent paradox... Meaningful discussion of a universal halting decider is therefore only feasible when such paradoxical programs are excluded from consideration."

    Turing's diagonal counterexample is renamed a 'paradox' by the paper's own Definition 1, and then the paper excludes all such 'paradoxical programs' from the quantifier 'all programs'. This makes the claimed universal decider's existence over the remaining programs true by construction rather than by mathematical discovery. The standard proof's contradiction is not independently shown to be a legitimate third category; it is labeled a paradox because it fits A→B/B→A, and that label is then used to remove the counterexample from the domain. This is a renaming of the known diagonalization result followed by a definitional restriction of the universal quantifier.

full rationale

The paper contains no self-citation chain, so the circularity does not come from citations. Rather, the load-bearing move is definitional. Section 2.1 defines 'Paradox' as a mutual-derivation structure A→B and B→A, and simultaneously asserts that A and B never hold together, concluding that paradoxes do not violate consistency. In classical logic, when B=¬A, A→B and B→A jointly entail both A and ¬A, so the asserted 'never simultaneously' is precisely what is at issue. The paper then applies this stipulated definition to the halting problem: Turing's proof gives A→B and B→A, the paper declares this a 'paradox', and on that basis refuses to reject the halting-decider premise. It further restricts 'all programs' to exclude the very counterexample. That is the central claim's support: the flaw in Turing's proof is established only by defining paradoxical programs as valid non-contradictions and then excluding them from the universal quantifier. The §4 'undecidability of paradoxes' argument inherits the same framework, since it assumes the paradoxical object is not a truth valuation or set of the same type. The derivation is therefore not self-contained against classical logic; it depends on a non-standard definition of contradiction that is stated but not justified. Score 8 reflects that the central conclusion is forced by definition and by renaming/exclusion, while some peripheral content (e.g., the S1 circular-affirmation discussion, the Möbius analogy) is independent.

Assumptions & free parameters 0 free parameters · 6 assumptions · 1 invented entities

No empirical parameters are fitted. The paper's load-bearing assumptions are definitional and logical: unrestricted comprehension, the ad hoc consistency of mutual negation, reliance on classical and Gödelian background results, and a nonstandard three-valued cycle. The invented 'paradox as a logical object' carries the whole argument but has no independent evidence.

assumptions (6)
  • domain assumption Unrestricted comprehension principle
    Defining S1 and S2 as sets relies on unrestricted comprehension (§2.1), and the paper insists this principle 'remains sound' (§3), though it is the source of inconsistency in naive set theory.
  • ad hoc to paper Mutual implication without simultaneous truth is consistent
    The central claim that A→B and B→A with opposite valuations is not a contradiction is assumed in Figure 1 case (3) and §2.2, but it is false in classical logic when B = ¬A.
  • standard math Classical two-valued logic with excluded middle
    The paper uses classical logic to set up Russell's paradox, then claims binary truth assignments become 'inapplicable' (§2.2), an internally inconsistent stance.
  • standard math Gödel's incompleteness theorem
    Cited in the introduction and §3 to motivate universal existence of paradox-like structures, but no formal link between incompleteness and the paper's 'paradox' definition is established.
  • standard math Turing's halting problem setup
    The existence of programs and halting predicates is assumed in order to critique the proof; the paper does not question the model of computation.
  • domain assumption Three-valued logic as cyclic valuations
    Definition 2 stipulates a paradox of A, B, C via A→B→C→A, which is not a standard three-valued logic semantics and is introduced solely for the paper's argument.
invented entities (1)
  • Paradox as a logical object/category
    purpose: To make paradoxes 'valid' without being truth valuations, allowing the claim that Russell's paradox belongs to a paradox of S1 and S2 rather than being a contradiction.
    The paper explicitly says the paradox 'cannot be defined as a set within the system' and 'does not occupy a categorical level parallel to A and B' (§4), but gives no independent semantics—no formal system—in which such objects are defined. It is introduced ad hoc to avoid the contradiction.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Paradoxes Are Not Contradictions: Re-examining the Third Mathematical Crisis." pith.science (2026). https://pith.science/paper/O3GURNKH

@misc{pith2026260717306,
  author       = {Pith},
  title        = {Pith review of: Paradoxes Are Not Contradictions: Re-examining the Third Mathematical Crisis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/O3GURNKH}},
  note         = {Machine review of arXiv:2607.17306}
}
read the original abstract

Russell's paradox was proposed in the early 20th century to address loopholes in set theory, which directly triggered the third mathematical crisis. This paper proposes and elaborates a perspective distinct from previous studies: paradoxes do not give rise to contradictions; instead, they constitute a M\"obius strip-style self-consistent logical structure via self-reference and negation under the logical rules within a system. G\"odel's incompleteness theorems indicate that such structures universally exist in formal logical systems. Turing proved the undecidability of the halting problem by first assuming the existence of a halting program and subsequently refuting this assumption through paradox construction, and this paper demonstrates flaws inherent to such proof strategy. Cases of paradoxes within three-valued logical systems are further discussed in this work, where the undecidability of paradoxes is rigorously proven. Finally, inspirations drawn from paradoxes for the real world are explored: two opposing factors can be integrated through the joint mechanism of self-reference and negation. A representative example is the wave-particle duality of light, whose essence may be interpreted as a paradox of waves and particles.

Figures

Figures reproduced from arXiv: 2607.17306 by the authors.

Figure 1
Figure 1. Three cases of contradictions. Subsequent rigorous derivations verify that the two propositions A and B involved in Russell’s paradox do not violate the consistency principle. According to the definition of S2, for any arbitrary set x, x ∈/ x holds if x ∈ S2; if x ∈/ S2, then 2 [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

8 extracted references · 1 canonical work pages

  1. [1]

    Frontiers in Handwriting Recognition (ICFHR), 2014 14th International Conference on , pages=

    Real-time segmentation of on-line handwritten arabic script , author=. Frontiers in Handwriting Recognition (ICFHR), 2014 14th International Conference on , pages=. 2014 , organization=

    2014

  2. [2]

    Soft Computing and Pattern Recognition (SoCPaR), 2014 6th International Conference of , pages=

    Fast classification of handwritten on-line Arabic characters , author=. Soft Computing and Pattern Recognition (SoCPaR), 2014 6th International Conference of , pages=. 2014 , organization=

    2014

  3. [3]

    arXiv preprint arXiv:1804.09028 , year=

    Estimate and Replace: A Novel Approach to Integrating Deep Neural Networks with Existing Applications , author=. arXiv preprint arXiv:1804.09028 , year=

    arXiv

  4. [4]

    The New Foundations of Mathematics, 1922

    Hilbert, D. The New Foundations of Mathematics, 1922

    1922

  5. [5]

    On Formally Undecidable Propositions of Principia Mathematica and Related Systems I, 1931

    Gödel, K. On Formally Undecidable Propositions of Principia Mathematica and Related Systems I, 1931

    1931

  6. [6]

    Novikov, V. P. Aspectual Principle, Benford's Law and Russell's Paradox, arXiv.math.CA, 2010, https://arxiv.org/abs/1012.5537

    arXiv 2010

  7. [7]

    A Closer Look at the Russell Paradox, Logique et Analyse, 2023, (262)

    Sheridan, F. A Closer Look at the Russell Paradox, Logique et Analyse, 2023, (262). DOI: 10.2143/LEA.262.0.3293616

    work page doi:10.2143/lea.262.0.3293616 2023

  8. [8]

    Du, G. P. Advances in Research on Russell’s Paradox. Journal of Hubei University (Philosophy and Social Sciences), 2012, 39(5): 1–6

    2012

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.