Mathematical developments of the incompleteness theorems

Cites work

scientific article; zbMATH DE number 3782996 (Why is no real title available?)
scientific article; zbMATH DE number 51556 (Why is no real title available?)
scientific article; zbMATH DE number 3628944 (Why is no real title available?)
scientific article; zbMATH DE number 1170091 (Why is no real title available?)
scientific article; zbMATH DE number 2014521 (Why is no real title available?)
scientific article; zbMATH DE number 3999883 (Why is no real title available?)
scientific article; zbMATH DE number 7162237 (Why is no real title available?)
scientific article; zbMATH DE number 227056 (Why is no real title available?)
scientific article; zbMATH DE number 2198106 (Why is no real title available?)
scientific article; zbMATH DE number 3285224 (Why is no real title available?)
scientific article; zbMATH DE number 3298833 (Why is no real title available?)
scientific article; zbMATH DE number 3334141 (Why is no real title available?)
scientific article; zbMATH DE number 3343689 (Why is no real title available?)
scientific article; zbMATH DE number 3365265 (Why is no real title available?)
scientific article; zbMATH DE number 3422356 (Why is no real title available?)
scientific article; zbMATH DE number 3020851 (Why is no real title available?)
scientific article; zbMATH DE number 3070439 (Why is no real title available?)
"Flexible" Predicates of Formal Number Theory
A generalization of the incompleteness theorem
A note on derivability conditions
A theorem on partial conservativity in arithmetic
An Absolutely Independent Set of ΣO‐Sentences
An Unsolvable Problem of Elementary Number Theory
Another look at the second incompleteness theorem
Arithmetical completeness theorem for modal logic $\mathsf{K}$
Arithmetization of metamathematics in a general setting
Calculating self-referential statements
Certified _1-sentences
Current research on Gödel's incompleteness theorems
Cuts, consistency statements and interpretations
Dense chains of ${\Sigma}_n$ sentences with strong conservativity properties
Essential hereditary undecidability
Exact Separation of Recursively Enumerable Sets Within Theories
Experimental logics and ^0_2-theories
Experimental logics and Π₃⁰ theories
Extensions of some theorems of Gödel and Church
Faith \& falsity
Fifty years of self-reference in arithmetic
Finding the limit of incompleteness. I
Generalizations of Gödel's incompleteness theorems for $\Sigma_n$-definable theories of arithmetic
Gödel theorems for nonconstructive logics.
Gödel's Second incompleteness theorem for Q
Gödel's second incompleteness theorem for _n-definable theories
Gödel-Rosser's incompleteness theorem, generalized and optimized for definable theories
Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
Incompleteness in the land of sets
Interpretability in Robinson's Q
Logische Syntax der Sprache
Models of axiomatic systems
On Computable Numbers, with an Application to the Entscheidungsproblem
On Godel's Second Incompleteness Theorem
On Guaspari's problem about partially conservative sentences
On Partially Conservative Sentences and Interpretability
On $\mathsf{Q}$
On axiomatizability within a system
On partial disjunction properties of theories containing Peano arithmetic
On the complexity of models of arithmetic
On the conservation results for local reflection principles
On weak completeness of intuitionistic predicate logic
Partially Conservative Extensions of Arithmetic
Pour-El's landscape
Redundancies in the Hilbert-Bernays derivability conditions for Gödel's second incompleteness theorem
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
Reflection principles and provability algebras in formal arithmetic
Relative Interpretations
Representability op recursively enumerable sets in formal theories
Rosser provability and the second incompleteness theorem
Self-reference and modal logic
Solution of a problem of Leon Henkin
Some remarks concerning theories with recursively enumerable complements
The role of the axiom of induction in elementary arithmetic
There are no minimal essentially undecidable theories
Variants of Robinson's essentially undecidable theoryR
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.

This page was built for publication: Mathematical developments of the incompleteness theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952157)