CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS

DOI10.1017/bsl.2020.44zbMath1497.03067arXiv2009.04887OpenAlexW3119506304MaRDI QIDQ4959663

Publication date: 17 September 2021

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.04887

zbMATH Keywords

Gödel's first incompleteness theorem intensionality interpretation Gödel's second incompleteness theorem concrete incompleteness

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Related Items

The subset relation and 2‐stratified sentences in set theory and class theory

Cites Work

Some abstract versions of G\"odel's second incompleteness theorem based on non-classical logics
Incompleteness for Higher-Order Arithmetic
HARRINGTON’S PRINCIPLE IN HIGHER ORDER ARITHMETIC
On Languages Which are Based on Non-Standard Arithmetic
Deduction-preserving "Recursive Isomorphisms" between theories
A survey of proof theory
On weak completeness of intuitionistic predicate logic
Transfinite recursive progressions of axiomatic theories
UNIVERSAL ROSSER PREDICATES
Systems of Logic Based on Ordinals^†
Note on arithmetic models for consistent formulae of the predicate calculus
Undecidable sentences generated by semantic paradoxes
A NOTE ON DERIVABILITY CONDITIONS
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
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
Unnamed Item
Unnamed Item
Unnamed Item
Gödelizing the Yablo sequence
Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
Yablifying the Rosser sentence
Rosser-type undecidable sentences based on Yablo's paradox
On Gödel incompleteness and finite combinatorics
The incompleteness theorems after 70 years
Phase transitions of iterated Higman-style well-partial-orderings
Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis and A. S. Troelstra. Reprint
Growing commas. A study of sequentiality and concatenation
The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
Harvey Friedman's research on the foundations of mathematics
Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems
Model theory of algebra and arithmetic. Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1-7, 1979
Model theory and arithmetic. Comptes rendus d'une action thematique programmee du C.N.R.S. sur la theorie des modeles et l'arithmetique, Paris, France, 1979/80
On the necessary use of abstract set theory
Classical recursion theory. The theory of functions and sets of natural numbers.
Provability interpretations of modal logic
Finite functions and the necessary use of large cardinals
Kolmogorov complexity and the second incompleteness theorem
On constructivity and the Rosser property: a closer look at some Gödelean proofs
On \(\mathsf{Q}\)
Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations
Undecidability without arithmetization
On formalization of model-theoretic proofs of Gödel's theorems
Slow consistency
The scope of Gödel's first incompleteness theorem
A generalization of the second incompleteness theorem and some exceptions to it
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
Derivability conditions on Rosser's provability predicates
Undecidable theories
Existentially closed structures and Gödel's second incompleteness theorem
Self-verifying axiom systems, the incompleteness theorem and related reflection principles
Heterologicality and Incompleteness
Interpretability in Robinson's Q
Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth
On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
The Surprise Examination Paradox and the Second Incompleteness Theorem
Gödel incompleteness theorems and the limits of their applicability. I
Can We Make the Second Incompleteness Theorem Coordinate Free?
Gödel–Rosser's Incompleteness Theorem, generalized and optimized for definable theories
Partially Conservative Extensions of Arithmetic
Solution of a problem of Leon Henkin
Arithmetization of metamathematics in a general setting
A generalization of the incompleteness theorem
Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
Phase transition thresholds for some Friedman-style independence results
Classifying the Provably Total Functions of PA
ON THE CLASSIFICATION OF PROPOSITIONAL PROVABILITY LOGICS
Arithmetic on semigroups
Cuts, consistency statements and interpretations
Combinatorial principles concerning approximations of functions
Rosser sentences
Flipping properties in arithmetic
Accessible Independence Results for Peano Arithmetic
Gödel's Second incompleteness theorem for Q
Other Proofs of Old Results
Tarski's System of Geometry
On Godel's Second Incompleteness Theorem
A Note on Boolos' Proof of the Incompleteness Theorem
On the incompleteness theorems
A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game
A classification of rapidly growing Ramsey functions
An application of graphical enumeration to PA *
Yablo's paradox
Paradox without Self-Reference
On Models Constructed by Means of the Arithmetized Completeness Theorem
GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑_n-DEFINABLE THEORIES OF ARITHMETIC
INCOMPLETENESS IN THE FINITE DOMAIN
Information-Theoretic Limitations of Formal Systems
Interlude: About the First Theorem
FINDING THE LIMIT OF INCOMPLETENESS I
ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
Gödel’s second incompleteness theorem for Σn-definable theories
ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM
Recursive functions and existentially closed structures
INCOMPLETENESS VIA PARADOX AND COMPLETENESS
SELF-REFERENCE IN ARITHMETIC I
SELF-REFERENCE IN ARITHMETIC II
From Tarski to Gödel—or how to derive the second incompleteness theorem from the undefinability of truth without self-reference
The Interpretation Existence Lemma
The Second Incompleteness Theorem: Reflections and Ruminations