Step by Recursive Step: Church's Analysis of Effective Calculability

DOI10.2307/421012zbMath0884.03001OpenAlexW2065924123MaRDI QIDQ4359525

Wilfried Sieg

Publication date: 17 March 1998

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

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0302-toc.htm

zbMATH Keywords

GödelTuringChurch's ThesisKleenePostChurchBernaysRosser

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03)

Related Items (12)

What is the Church-Turing Thesis? ⋮ Can Church's thesis be viewed as a Carnapian explication? ⋮ Diagonalisation and Church's Thesis: Kleene's Homework ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ The Prospects for Mathematical Logic in the Twenty-First Century ⋮ Gödel's reception of Turing's model of computability: the shift of perception in 1934 ⋮ 1999 Spring Meeting of the Association for Symbolic Logic ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ Only Two Letters: The Correspondence between Herbrand and Gödel ⋮ Mathematical and Technological Computability ⋮ A variant of a recursively unsolvable problem

Cites Work

• Unnamed Item
• Unnamed Item
• A set of postulates for the foundation of logic
• A set of postulates for the foundation of logic. II
• Proof by cases in formal logic
• A mathematical logic without variables. I
• The inconsistency of certain formal logics
• General recursive functions of natural numbers
• \(\lambda\)-definability and recursiveness
• Second Thoughts about Church's Thesis and Mathematical Proofs
• Why Gödel didn't have church's thesis
• The Richard Paradox
• A Theory of Positive Integers in Formal Logic. Part II
• Paper Machines
• A Proof of Freedom from Contradiction
• An Unsolvable Problem of Elementary Number Theory
• A note on the Entscheidungsproblem
• A note on recursive functions
• Finite combinatory processes—formulation
• Ein Verfahren der mathematischen Logik

This page was built for publication: Step by Recursive Step: Church's Analysis of Effective Calculability