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

DOI10.2307/421012MaRDI QIDQ4359525zbMATH OpenOpenAlexFDO

Authors Wilfried Sieg

Publication date 17 March 1998

Published in The 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

BernaysChurchChurch's ThesisGödelKleenePostRosserTuring

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4068851
• scientific article; zbMATH DE number 727991
• Kalmár's argument against the plausibility of Church's thesis
• A Natural Axiomatization of Computability and Proof of Church's Thesis

Cites work

• \(\lambda\)-definability and recursiveness
• A mathematical logic without variables. I
• A note on recursive functions
• A note on the Entscheidungsproblem
• A Proof of Freedom from Contradiction
• A set of postulates for the foundation of logic
• A set of postulates for the foundation of logic. II
• A Theory of Positive Integers in Formal Logic. Part II
• An Unsolvable Problem of Elementary Number Theory
• Ein Verfahren der mathematischen Logik
• Finite combinatory processes—formulation
• General recursive functions of natural numbers
• scientific article; zbMATH DE number 857585 (Why is no real title available?)
• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• Paper Machines
• Proof by cases in formal logic
• Second thoughts about Church's thesis and mathematical proofs
• The inconsistency of certain formal logics
• The Richard Paradox
• Why Gödel didn't have church's thesis

Cited in

(24)

• Reflections on Church's thesis
• Gödel's reception of Turing's model of computability: the shift of perception in 1934
• Can Church's thesis be viewed as a Carnapian explication?
• The prospects for mathematical logic in the twenty-first century
• An early history of recursive functions and computability from Gödel to Turing
• Only Two Letters: The Correspondence between Herbrand and Gödel
• Closing the Circle: An Analysis of Emil Post's Early Work
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• scientific article; zbMATH DE number 4068851 (Why is no real title available?)
• scientific article; zbMATH DE number 727991 (Why is no real title available?)
• Conceptual Confluence in 1936: Post and Turing
• Why Turing’s Thesis Is Not a Thesis
• 1999 Spring Meeting of the Association for Symbolic Logic
• Mathematical and technological computability
• What is the Church-Turing Thesis?
• Kalmár's argument against the plausibility of Church's thesis
• scientific article; zbMATH DE number 5064406 (Why is no real title available?)
• Diagonalisation and Church's Thesis: Kleene's Homework
• Effectiveness
• A variant of a recursively unsolvable problem
• Logical Approaches to Computational Barriers
• Theoretical computer science: computability, decidability and logic
• Martin Davis: an overview of his work in logic, computer science, and philosophy
• Is the concept of computation a conceptual fixed point?

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

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