The scope of Gödel's first incompleteness theorem

DOI10.1007/s11787-014-0107-3zbMath1339.03004OpenAlexW2011972140WikidataQ55969988 ScholiaQ55969988MaRDI QIDQ2254575

Bernd Buldt

Publication date: 5 February 2015

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11787-014-0107-3

zbMATH Keywords

Gödelfirst incompleteness theorem

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Gödel numberings and issues of incompleteness (03F40)

Related Items (3)

CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Distilling the requirements of Gödel's incompleteness theorems with a proof assistant ⋮ A formally verified abstract account of Gödel's incompleteness theorems

Cites Work

• The incompleteness theorems after 70 years
• What is the world of mathematics?
• Nonstandard models and Kripke's proof of the Gödel theorem
• Non-standard models of Peano arithmetic
• The fuzzification of systems. The genesis of fuzzy set theory and its initial applications. Developments up to the 1970s. Transl. from the German
• On the interpretability of arithmetic in temporal logic
• A new proof of the fixed-point theorem of provability logic
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• The varieties of arboreal experience
• Harvey Friedman's research on the foundations of mathematics
• Self-reference and modal logic
• Inconsistent number systems
• On the scheme of induction for bounded arithmetic formulas
• The decision problem for exponential diophantine equations
• Foundational studies. Selected works. Vol. I, II
• Some rapidly growing functions
• Fifty years of self-reference in arithmetic
• Minimally inconsistent LP
• Classical recursion theory. The theory of functions and sets of natural numbers
• The logic of paradox
• \(\supset\)E is admissible in ``true relevant arithmetic
• On interpreting Chaitin's incompleteness theorem
• Metamathematics of fuzzy logic
• A minimal predicative set theory
• Inconsistent models of arithmetic. I: Finite models
• Introduction to computability logic
• On the independence of axioms in BL and MTL
• Undecidability without arithmetization
• Is complexity a source of incompleteness?
• A note on Priest's finite inconsistent arithmetics
• On the interpretability of arithmetic in set theory
• Undecidable theories
• Inconsistent models of arithmetic Part II: the general case
• Existentially closed structures and Gödel's second incompleteness theorem
• Undefinability of truth. the problem of priority:tarski vs gödel
• Towards metamathematics of weak arithmetics over fuzzy logic
• Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth
• A MACHINE-ASSISTED PROOF OF GÖDEL’S INCOMPLETENESS THEOREMS FOR THE THEORY OF HEREDITARILY FINITE SETS
• Three universal representations of recursively enumerable sets
• Gödel incompleteness theorems and the limits of their applicability. I
• Algorithmic information theory
• On ω-consistency and related properties
• The classical and the ω-complete arithmetic
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• HILBERT'S PROGRAMME
• A generalization of the incompleteness theorem
• Incompleteness in a General Setting
• Arithmetic on semigroups
• Inconsistent models for relevant arithmetics
• Algorithmic Information Theory
• "Flexible" Predicates of Formal Number Theory
• How to Program an Infinite Abacus
• Theories incomparable with respect to relative interpretability
• Universal diophantine equation
• Accessible Independence Results for Peano Arithmetic
• Iterated reflection principles and the ω-rule
• Reflecting on incompleteness
• Whither relevant arithmetic?
• A Theory of Program Size Formally Identical to Information Theory
• Independent Gödel sentences and independent sets
• On the effective ω‐rule
• Avoiding Self-Referential Statements
• Other Proofs of Old Results
• A Note on Boolos' Proof of the Incompleteness Theorem
• On the incompleteness theorems
• An Answer to Hellman's Question: ‘Does Category Theory Provide a Framework for Mathematical Structuralism?’†
• A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
• Transfinite Progressions: A Second Look at Completeness
• Completeness and Categoricity. Part I: Nineteenth-century Axiomatics to Twentieth-century Metalogic
• 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
• 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
• Variants of Robinson's essentially undecidable theoryR
• Finite sets and Gödel's incompleteness theorems
• An addition to Rosser's theorem
• Interlude: About the First Theorem
• CATEGORICAL FOUNDATIONS OF MATHEMATICS OR HOW TO PROVIDE FOUNDATIONS FORABSTRACTMATHEMATICS
• SELF-REFERENCE IN ARITHMETIC II
• An Absolutely Independent Set of ΣO‐Sentences
• Reflections on the Categorical Foundations of Mathematics
• On LP-models of arithmetic
• Fuzzy sets
• AN ELEMENTARY THEORY OF THE CATEGORY OF SETS
• Languages in which self reference is possible
• Categories in Context: Historical, Foundational, and Philosophical
• Transfinite recursive progressions of axiomatic theories
• Incompleteness along paths in progressions of theories
• Extensions of some theorems of Gödel and Church
• Gödel Theorems for Non-Constructive Logics
• Systems of Logic Based on Ordinals^†
• Definability and decision problems in arithmetic
• What is Cantor's Continuum Problem?
• A generalization of the concept of ω-consistency
• Undecidable sentences generated by semantic paradoxes
• Philosophy of mathematics
• Injecting inconsistencies into models of PA
• String theory

This page was built for publication: The scope of Gödel's first incompleteness theorem