- From the Publisher via CrossRef (no proxy)
- arxiv.org
(no proxy) - arxiv.org [2] (no proxy)
- citeseerx.ist.psu.edu (no proxy)
- projecteuclid.org (no proxy)
- cs.sfu.ca (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- authors.library.caltech.edu (no proxy)
- cambridge.org (no proxy)
The prospects for mathematical logic in the twenty-first century
Abstract
The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independentlyAuthor's Profile
Other Versions
No versions found
My notes
Similar books and articles
Samuel R. Buss. First-order proof theory of arithmetic. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 79–147. [REVIEW]Toshiyasu Arai -2000 -Bulletin of Symbolic Logic 6 (4):465-466.
Review: Samuel R. Buss, Handbook of Proof Theory: The Logic of Provability. [REVIEW]Toshiyasu Arai -2000 -Bulletin of Symbolic Logic 6 (4):74-75.
Samuel R. Buss. An introduction to proof theory. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, p. v., pp. 1–78. [REVIEW]Toshiyasu Arai -2000 -Bulletin of Symbolic Logic 6 (4):464-465.
Logic Colloquium '87: Proceedings of the Colloquium Held in Granada, Spain, July 20-25, 1987.Heinz-Dieter Ebbinghaus -1989 - Elsevier.
Wolfram Pohlers. Subsystems of set theory and second-order number theory. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 209–335. [REVIEW]Toshiyasu Arai -2000 -Bulletin of Symbolic Logic 6 (4):467-469.
A. S. Troelstra. Realizability. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 407–473. [REVIEW]Toshiyasu Arai -2000 -Bulletin of Symbolic Logic 6 (4):470-471.
Logic and Probability.Kenny Easwaran -2010 -Journal of the Indian Council of Philosophical Research 27 (2):229-253.
Analytics
Added to PP
2009-01-28
Downloads
106 (#213,110)
6 months
25 (#132,193)
2009-01-28
Downloads
106 (#213,110)
6 months
25 (#132,193)
Historical graph of downloads
How can I increase my downloads?Author's Profile
Citations of this work
The Church-Turing Thesis.B. Jack Copeland -2012 - In Ed Zalta,Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.
A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz &Yuri Gurevich -2008 -Bulletin of Symbolic Logic 14 (3):299-350.
When are two algorithms the same?Andreas Blass,Nachum Dershowitz &Yuri Gurevich -2009 -Bulletin of Symbolic Logic 15 (2):145-168.
The Dividing Line Methodology: Model Theory Motivating Set Theory.John T. Baldwin -2021 -Theoria 87 (2):361-393.
References found in this work
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing -1936 -Proceedings of the London Mathematical Society 42 (1):230-265.
Simple theories.Byunghan Kim &Anand Pillay -1997 -Annals of Pure and Applied Logic 88 (2-3):149-164.
A borel reducibility theory for classes of countable structures.Harvey Friedman &Lee Stanley -1989 -Journal of Symbolic Logic 54 (3):894-914.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-54b44b69b7-72j75 uwo