ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
From MaRDI portal
Publication:5001552
DOI10.1017/S1755020320000192zbMath1487.03070arXiv1803.08392MaRDI QIDQ5001552
Publication date: 22 July 2021
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.08392
Philosophical and critical aspects of logic and foundations (03A05) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)
Related Items (6)
SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS ⋮ Numberings, c.e. oracles, and fixed points ⋮ MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE ⋮ A step towards absolute versions of metamathematical results ⋮ Varieties of self-reference in metamathematics ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof lengths for instances of the Paris-Harrington principle
- Hilbert's program. An essay on mathematical instrumentalism
- On the scheme of induction for bounded arithmetic formulas
- Acceptable notation
- Classical recursion theory. The theory of functions and sets of natural numbers
- A taxonomy of deviant encodings
- Transfinite induction within Peano arithmetic
- Church's thesis and the conceptual analysis of computability
- Undecidable theories
- Can We Make the Second Incompleteness Theorem Coordinate Free?
- Solution of a problem of Leon Henkin
- Arithmetization of metamathematics in a general setting
- Theory of Formal Systems. (AM-47)
- Three Paths to Effectiveness
- Gödel's Second incompleteness theorem for Q
- Hilbert's Tenth Problem is Unsolvable
- Giving an Account of Provability Within a Theory
- Interlude: About the First Theorem
- SELF-REFERENCE IN ARITHMETIC I
- The Second Incompleteness Theorem: Reflections and Ruminations
- Computing with Numbers and Other Non-syntactic Things: De re Knowledge of Abstract Objects†
- The Church-Turing Thesis over Arbitrary Domains
- Computable Algebra, General Theory and Theory of Computable Fields
- A NOTE ON DERIVABILITY CONDITIONS
- What Does Gödel's Second Theorem Say†
- A concise introduction to mathematical logic
- String theory
This page was built for publication: ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS