Mathematical Logic Quarterly 40 (3):422-424 (1994)

We sketch proofs of the theorems of Church-Turing and Trachtenbrot using a semi-monomorphic axiomatization
Keywords Theorem of Trachtenbrot  Theorem of Church‐Turing  Undecidability of satisfiability
Categories (categorize this paper)
DOI 10.1002/malq.19940400311
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 57,138
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Analogy and Diagonal Argument.Zbigniew Tworak - 2006 - Logic and Logical Philosophy 15 (1):39-66.
What Turing Did After He Invented the Universal Turing Machine.Diane Proudfoot & Jack Copeland - 2000 - Journal of Logic, Language and Information 9:491-509.
Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
A Formal Theorem in Church's Theory of Types.M. H. A. Newman & A. M. Turing - 1942 - Journal of Symbolic Logic 7 (1):28-33.


Added to PP index

Total views
40 ( #253,471 of 2,411,692 )

Recent downloads (6 months)
1 ( #539,172 of 2,411,692 )

How can I increase my downloads?


My notes