Systems of Logic Based on Ordinals†
From MaRDI portal
Publication:5773619
DOI10.1112/PLMS/S2-45.1.161zbMATH Open0021.09704DBLPphd/Turing38OpenAlexW4291166496WikidataQ7663875 ScholiaQ7663875MaRDI QIDQ5773619FDOQ5773619
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
Cited In (73)
- An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion
- Accelerating machines: a review
- Toward a theory of intelligence
- Reflection calculus and conservativity spectra
- Axiomatizing provable \(n\)-provability
- Formalism and intuition in computability
- Definability as hypercomputational effect
- Investigations on the approximability and computability of the Hilbert transform with applications
- Computational power of infinite quantum parallelism
- Independent axiomatizability of sets of sentences
- Computation as an unbounded process
- Hierarchies of number-theoretic predicates
- Emergence as a computability-theoretic phenomenon
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- Is there any real substance to the claims for a ``new computationalism?
- Coinduction for exact real number computation
- Recursive Predicates and Quantifiers
- Semantics of quantum programming languages: Classical control, quantum control
- Title not available (Why is that?)
- Inductive logic programming
- Intuitionism and the liar paradox
- Mechanism, truth, and Penrose's new argument
- Intervals containing exactly one c.e. degree
- Physical constraints on hypercomputation
- Hypercomputation: Philosophical issues
- Informal and absolute proofs: some remarks from a Gödelian perspective
- The scope of Gödel's first incompleteness theorem
- Informal versus formal mathematics
- On mind \& Turing's machines
- On approximations for functions in the space of uniformly convergent Fourier series
- The origins of the halting problem
- Constructive dimension and Turing degrees
- Provability algebras and proof-theoretic ordinals. I
- The modal argument for hypercomputing minds
- A personal account of Turing's imprint on the development of computer science
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
- Feferman and the Truth
- Reactive Turing Machines
- Three topological reducibilities for discontinuous functions
- How to build a hypercomputer
- The influence of domain interpretations on computational models
- Super-tasks, accelerating Turing machines and uncomputability
- Superefficiency from the vantage point of computability
- Significato e verita nell'aritmetica peaniana
- On bimodal logics of provability
- How We Think of Computing Today
- Extending and interpreting Post's programme
- Iterated local reflection versus iterated consistency
- Turing: the great unknown
- Ordinal arithmetic: Algorithms and mechanization
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
- ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY
- A splitting theorem for \(n\)-REA degrees
- The case for hypercomputation
- Interactive foundations of computing
- Turing-Taylor expansions for arithmetic theories
- The machine as data: a computational view of emergence and definability
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule
- The Church-Turing Thesis over Arbitrary Domains
- A Fortuitous Year with Leon Henkin
- Fair play for machines
- Multi-Resolution Cellular Automata for Real Computation
- The Possibility of Analysis: Convergence and Proofs of Convergence
- Complexity barriers as independence
- Did Turing stand on Gödel's shoulders?
- Approaching simple and powerful service-computing1
- Mass problems and density
- Incomputability Emergent, and Higher Type Computation
- On some algebraic ways to calculate zeros of the Riemann zeta function
- An open formalism against incompleteness
- Mathematics, Metaphysics and the Multiverse
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS
- Why Turing’s Thesis Is Not a Thesis
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)
