Notre Dame Journal of Formal Logic 61 (1):155-180 (2020)
AbstractTuring progressions arise by iteratedly adding consistency statements to a base theory. Different notions of consistency give rise to different Turing progressions. In this paper we present a logic that generates exactly all relations that hold between these different Turing progressions given a particular set of natural consistency notions. Thus, the presented logic is proven to be arithmetically sound and complete for a natural interpretation, named the formalized Turing progressions interpretation.
Similar books and articles
Turing–Taylor Expansions for Arithmetic Theories.Joost Joosten - 2016 - Studia Logica 104 (6):1225-1243.
Provability logics for natural Turing progressions of arithmetical theories.L. D. Beklemishev - 1991 - Studia Logica 50 (1):107 - 128.
Alan Turing and the Turing Machine.Turing's Analysis of Computability, and Major Applications of it.The Confluence of Ideas in 1936.Turing in the Land of O.Mathematical Logic and the Origin of Modern Computers. [REVIEW]John N. Crossley, Andrew Hodges, Rolf Herken, Stephen C. Kleene, Robin Gandy, Solomon Feferman, Martin Davis & Esther R. Phillips - 1991 - Journal of Symbolic Logic 56 (3):1089.
S. Barry Cooper and Andrew Hodges , The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp.— therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4–19. - J.M.E. Hyland. The Forgotten Turing. pp. 20–33. - Andrew R. Booker. Turing and the Primes. pp. 34–52. - Ueli Maurer. Cryptography and Computation after Turing. pp. 53–77. - Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 78–89. - Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92–105. - Christof Teuscher. Designed versus Intrinsic Computation. pp. 106–116. - Solomon Feferman. Turing’s ‘Oracle’: From Absolute to Relative Computability and Back. pp. 300–334. - P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335–360. - Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361–378. [REVIEW]Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (3):354-356.
Turing cones and set theory of the reals.Benedikt Löwe - 2001 - Archive for Mathematical Logic 40 (8):651-664.
About Segment Complexity of Turing Reductions.Valeriy K. Bulitko - 1999 - Mathematical Logic Quarterly 45 (4):561-571.
Turing's World 3.0 for the Macintosh an Introduction to Computability Theory.Jon Barwise & John Etchemendy - 1993
Turing's golden: How well Turing's work stands today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Introduction to Turing categories.J. Robin B. Cockett & Pieter Jw Hofstra - 2008 - Annals of Pure and Applied Logic 156 (2):183-209.
A Formal Approach to Exploring the Interrogator's Perspective in the Turing Test.Paweł Łupkowski - 2011 - Logic and Logical Philosophy 20 (1-2):139-158.
Added to PP
Historical graph of downloads
Citations of this work
No citations found.
References found in this work
Proof-theoretic analysis by iterated reflection.Lev D. Beklemishev - 2003 - Archive for Mathematical Logic 42 (6):515-552.
Provability algebras and proof-theoretic ordinals, I.Lev D. Beklemishev - 2004 - Annals of Pure and Applied Logic 128 (1-3):103-123.
Positive provability logic for uniform reflection principles.Lev Beklemishev - 2014 - Annals of Pure and Applied Logic 165 (1):82-105.
Hyperations, Veblen progressions and transfinite iteration of ordinal functions.David Fernández-Duque & Joost J. Joosten - 2013 - Annals of Pure and Applied Logic 164 (7-8):785-801.
Iterated local reflection versus iterated consistency.Lev Beklemishev - 1995 - Annals of Pure and Applied Logic 75 (1-2):25-48.