A note on the logic of Turing's halting paradox

Australasian Journal of Logic 22 (5):554-570 (2025)
  Copy   BIBTEX

Abstract

Projects directed at a universal logic (notably, Brady's [Brady 2006]) have long struggled with paradoxes. In just the domain of computability, Hilbert's call for a general decision procedure was scuttled by Turing, using a diagonal argument. Indeed, Turing's halting problem can be straightforwardly viewed as a paradox, of the same type as others like the Liar and Curry's. This is confirmed here by reconstructing a halting predicate in a sequent calculus setting, thereby fitting a ``recipe' for paradox in [Ahmad, AJL 2022]. The usual range of possible solutions then apply, including especially substructural approaches. Bringing this work as a response to Brady's ``"Starting the Dismantling of Classical Mathematics" [Brady, AJL 2018], then, we assess his proposals to drop the law of excluded middle and other logical principles---asking whether this strategy avoids all versions of the halting paradox. Brady has well begun, in his idiom, the re-construction of mathematics; there is more yet to do.

Other Versions

No versions found

Analytics

Added to PP
2025-09-12

Downloads
49 (#1,198,435)

6 months
20 (#532,237)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Fernando Cano-Jorge
University of Otago

Citations of this work

Add more citations

References found in this work

In contradiction: a study of the transconsistent.Graham Priest - 2006 - New York: Oxford University Press.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Paradoxes and Failures of Cut.David Ripley - 2013 - Australasian Journal of Philosophy 91 (1):139 - 164.
Paradoxes and Inconsistent Mathematics.Zach Weber - 2021 - New York, NY: Cambridge University Press.

View all 33 references / Add more references