David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Kluwer Academic / Plenum Publishers (2000)
Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999.
|Categories||categorize this paper)|
|Buy the book||$103.29 new (26% off) $104.44 used (25% off) $139.00 direct from Amazon Amazon page|
|Call number||QA9.47.M56 2000|
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.
Citations of this work BETA
Tamar Lando (2012). Completeness of S4 for the Lebesgue Measure Algebra. Journal of Philosophical Logic 41 (2):287-316.
Makoto Kanazawa (2010). Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars. Journal of Logic, Language and Information 19 (2):137-161.
Can Başkent (2013). Some Topological Properties of Paraconsistent Models. Synthese 190 (18):4023-4040.
Similar books and articles
Philip Kremer (1997). On the Complexity of Propositional Quantification in Intuitionistic Logic. Journal of Symbolic Logic 62 (2):529-544.
Stefano Berardi (1999). Intuitionistic Completeness for First Order Classical Logic. Journal of Symbolic Logic 64 (1):304-312.
Michael A. E. Dummett (2000). Elements of Intuitionism. Oxford University Press.
Giambattista Amati, Luigia Carlucci-Aiello & Fiora Pirri (1997). Intuitionistic Autoepistemic Logic. Studia Logica 59 (1):103-120.
Enrico Martino (1998). Negationless Intuitionism. Journal of Philosophical Logic 27 (2):165-177.
Takahito Aoto (1999). Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8 (2):217-242.
Peter W. O'Hearn & David J. Pym (1999). The Logic of Bunched Implications. Bulletin of Symbolic Logic 5 (2):215-244.
Daniel Dzierzgowski (1995). Models of Intuitionistic TT and N. Journal of Symbolic Logic 60 (2):640-653.
Neil Tennant (1994). Intuitionistic Mathematics Does Not Needex Falso Quodlibet. Topoi 13 (2):127-133.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?