HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

DOI10.1017/S1755020321000307MaRDI QIDQ5024504

Rasmus Blanck

Publication date: 26 January 2022

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

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

zbMATH Keywords

incompletenessfragments of arithmeticpartial conservativityarithmetically definable theories

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Gödel numberings and issues of incompleteness (03F40) Relative consistency and interpretations (03F25)

Related Items

On Guaspari's problem about partially conservative sentences

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
• A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\)
• Self-reference and modal logic
• Fifty years of self-reference in arithmetic
• The prime number theorem and fragments of PA
• A course in model theory. An introduction to contemporary mathematical logic. Transl. from the French by Moses Klein
• On partial disjunction properties of theories containing Peano arithmetic
• A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic
• Gödel–Rosser's Incompleteness Theorem, generalized and optimized for definable theories
• Partially Conservative Extensions of Arithmetic
• The classical and the ω-complete arithmetic
• Arithmetization of metamathematics in a general setting
• A generalization of the incompleteness theorem
• Reflection principles and provability algebras in formal arithmetic
• On the complexity of models of arithmetic
• A Note on a Theorem of H. FRIEDMAN
• "Flexible" Predicates of Formal Number Theory
• Theories incomparable with respect to relative interpretability
• Experimental logics and Π₃⁰ theories
• Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
• A small reflection principle for bounded arithmetic
• GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑_n-DEFINABLE THEORIES OF ARITHMETIC
• Gödel’s second incompleteness theorem for Σn-definable theories
• The interpretability logic of Peano arithmetic
• AXIOMATIZATION OF PROVABLE n-PROVABILITY
• On strong provability predicates and the associated modal logics
• THE ∀∃ THEORY OF PEANO Σ₁ SENTENCES
• On Languages Which are Based on Non-Standard Arithmetic
• Representability of recursively enumerable sets in formal theories
• Transfinite recursive progressions of axiomatic theories
• Representability op recursively enumerable sets in formal theories
• MARGINALIA ON A THEOREM OF WOODIN
• On axiomatizability within a system