Systems of Logic Based on Ordinals†

DOI10.1112/PLMS/S2-45.1.161MaRDI QIDQ5773619zbMATH OpenOpenAlexDBLPWikidataFDO

Authors A. M. Turing

Publication date 1939

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/21.11116/0000-0001-91CE-3

zbMATH Keywords

Foundations, philosophy, logic

Cited in

(73)

• Why Turing’s Thesis Is Not a Thesis
• Reactive Turing machines
• An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion
• Toward a theory of intelligence
• Accelerating machines: a review
• Fair play for machines
• Axiomatizing provable \(n\)-provability
• Definability as hypercomputational effect
• Formalism and intuition in computability
• Investigations on the approximability and computability of the Hilbert transform with applications
• Reflection calculus and conservativity spectra
• Independent axiomatizability of sets of sentences
• Computational power of infinite quantum parallelism
• Incomputability emergent, and higher type computation
• Computation as an unbounded process
• Emergence as a computability-theoretic phenomenon
• Hierarchies of number-theoretic predicates
• Arithmetical interpretations and Kripke frames of predicate modal logic of provability
• Coinduction for exact real number computation
• Is there any real substance to the claims for a ``new computationalism?
• AXIOMATIZATION OF PROVABLE n-PROVABILITY
• Semantics of quantum programming languages: Classical control, quantum control
• Recursive Predicates and Quantifiers
• Complexity barriers as independence
• Current research on Gödel's incompleteness theorems
• Did Turing stand on Gödel's shoulders?
• Approaching simple and powerful service-computing¹
• Intuitionism and the liar paradox
• Mechanism, truth, and Penrose's new argument
• Inductive logic programming
• Intervals containing exactly one c.e. degree
• Hypercomputation: Philosophical issues
• Physical constraints on hypercomputation
• Mass problems and density
• Informal and absolute proofs: some remarks from a Gödelian perspective
• Informal versus formal mathematics
• On mind \& Turing's machines
• The scope of Gödel's first incompleteness theorem
• On approximations for functions in the space of uniformly convergent Fourier series
• Constructive dimension and Turing degrees
• The origins of the halting problem
• A personal account of Turing's imprint on the development of computer science
• Provability algebras and proof-theoretic ordinals. I
• The modal argument for hypercomputing minds
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• Feferman and the Truth
• How to build a hypercomputer
• The influence of domain interpretations on computational models
• Superefficiency from the vantage point of computability
• Super-tasks, accelerating Turing machines and uncomputability
• Three topological reducibilities for discontinuous functions
• Significato e verita nell'aritmetica peaniana
• On bimodal logics of provability
• A fortuitous year with Leon Henkin
• Extending and interpreting Post's programme
• How We Think of Computing Today
• Iterated local reflection versus iterated consistency
• Turing: the great unknown
• Ordinal arithmetic: Algorithms and mechanization
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
• A splitting theorem for \(n\)-REA degrees
• The case for hypercomputation
• Interactive foundations of computing
• On some algebraic ways to calculate zeros of the Riemann zeta function
• An open formalism against incompleteness
• Mathematics, Metaphysics and the Multiverse
• Turing-Taylor expansions for arithmetic theories
• The machine as data: a computational view of emergence and definability
• Multi-resolution cellular automata for real computation
• The possibility of analysis: convergence and proofs of convergence
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule
• The Church-Turing Thesis over Arbitrary Domains

This page was built for publication: Systems of Logic Based on Ordinals^†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5773619)