Extensions of some theorems of Gödel and Church

DOI10.2307/2269028zbMath0015.33802OpenAlexW4382891196MaRDI QIDQ5764758

No author found.

Publication date: 1936

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

Full work available at URL: https://doi.org/10.2307/2269028

zbMATH Keywords

Foundations, philosophy, logic

Related Items (26)

On decidability of the theory with the transitive closure operator ⋮ Representing the knowledge of Turing machines ⋮ Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 ⋮ Arithmetical completeness theorems for monotonic modal logics ⋮ In defense of logical universalism: taking issue with Jean van Heijenoort ⋮ GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑_n-DEFINABLE THEORIES OF ARITHMETIC ⋮ Sixty years after Gödel ⋮ An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion ⋮ Rosser-type undecidable sentences based on Yablo's paradox ⋮ Formal axiomatic theories based on a three-valued logic ⋮ Malament-Hogarth machines and Tait's axiomatic conception of mathematics ⋮ The scope of Gödel's first incompleteness theorem ⋮ Uniform density in Lindenbaum algebras ⋮ Robust and nonlinear control literature survey (No. 3) ⋮ Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski ⋮ Bemerkungen zum Begriff der inhaltlichen Widerspruchsfreiheit ⋮ Undecidability of equality for codata types ⋮ Rosser and Mostowski sentences ⋮ ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP ⋮ Contributions to the reduction theory of the decision problem ⋮ Definability, decidability, complexity ⋮ Arithmetical problems and recursively enumerable predicates ⋮ The Gödelian Inferences ⋮ Representations of calculi ⋮ TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS ⋮ ON THE FOUNDATIONS OF MATHEMATICAL ECONOMICS

Cites Work

• General recursive functions of natural numbers
• An Unsolvable Problem of Elementary Number Theory

This page was built for publication: Extensions of some theorems of Gödel and Church