Sentences undecidable in formalized arithmetic. An exposition of the theory of Kurt Gödel
From MaRDI portal
Publication:2650013
zbMath0047.00903MaRDI QIDQ2650013
Publication date: 1952
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Related Items
The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem ⋮ On the number of steps in proofs ⋮ Two recursion theoretic characterizations of proof speed-ups ⋮ Metamathematische Begriffe in Standardtheorien ⋮ On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics ⋮ Set theory and the analyst ⋮ Polynomially and superexponentially shorter proofs in fragments of arithmetic ⋮ Andrzej Mostowski: A Biographical Note ⋮ A View of Revival of Mathematical Logic in Warsaw, 1945–1975 ⋮ Quantification for Peirce's preferred system of triadic logic ⋮ COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY ⋮ On the status of reflection and conservativity in replacement theories of truth ⋮ Von Neumann, Gödel and Complexity Theory ⋮ The algebraic treatment of the methodology of elementary deductive systems ⋮ An undecidable problem in the algebra of truth-tables ⋮ Nicht-Standardmodelle der Zahlentheorie
