A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity

Bulletin of Symbolic Logic 13 (4):538-540 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1203350881

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A first course in logic: an introduction to model theory, proof theory, computability, and complexity.Shawn Hedman - 2004 - New York: Oxford University Press.
REVIEWS-A first course in logic: An introduction to model theory, proof theory, computability, and complexity.S. Hedman & Alasdair Urquhart - 2007 - Bulletin of Symbolic Logic 13 (4):538-539.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Set theory, model theory, and computability theory.Wilfrid Hodges - 2011 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press. pp. 471.
Proofs and computations.Helmut Schwichtenberg - 2012 - New York: Cambridge University Press. Edited by S. S. Wainer.
Computability, complexity, logic.Egon Börger - 1989 - New York, N.Y., U.S.A.: Elsevier Science Pub. Co..
Introduction to Computability Theory.D. Normann - 2010
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Proof theory: a selection of papers from the Leeds Proof Theory Programme, 1990.Peter Aczel, Harold Simmons & Stanley S. Wainer (eds.) - 1992 - New York: Cambridge University Press.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Non-classical logics, model theory, and computability: proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976.Ayda I. Arruda, Newton C. A. Costa & R. Chuaqui (eds.) - 1977 - New York: sale distributors for the U.S.A. and Canada, Elsevier/North-Holland.
Interactive and probabilistic proof-checking.Luca Trevisan - 2000 - Annals of Pure and Applied Logic 104 (1-3):325-342.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.

Analytics

Added to PP
2017-02-22

Downloads
32 (#499,655)

6 months
6 (#520,848)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alasdair Urquhart
University of Toronto, St. George Campus

Citations of this work

Fictionalism and Mathematical Objectivity.Iulian D. Toader - 2012 - In Mircea Dumitru, Mircea Flonta & Valentin Muresan (eds.), Metaphysics and Science. Dedicated to professor Ilie Pârvu. Universty of Bucharest Press. pp. 137-158.

Add more citations

References found in this work

No references found.

Add more references