- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Explicit provability and constructive semantics [Book Review]
Bulletin of Symbolic Logic 8 (3):432-432 (2002)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Explicit Provability and Constructive Semantics.[author unknown] - 2002 - Bulletin of Symbolic Logic 8 (3):432-433.
Review: Sergei N. Artemov, Explicit Provability and Constructive Semantics. [REVIEW]Jeremy D. Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):432-433.
Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Sergei N. Artemov. Explicit provability and constructive semantics. The bulletin of symbolic logic, vol. 7 , pp. 1–36. [REVIEW]Jeremy D. Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):432-433.
A quantified logic of evidence.Melvin Fitting - 2008 - Annals of Pure and Applied Logic 152 (1):67-83.
Review: Jeremy Avigad, A Realizability Interpretation for Classical Arithmetic. [REVIEW]Ulrich Berger - 2002 - Bulletin of Symbolic Logic 8 (3):439-440.
Review: Jeremy Avigad, Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Jeremy Avigad. Update procedures and the 1-consistency of arithmetic. Mathematical Logic Quarterly, vol. 48 , pp. 3–13.Toshiyasu Arai - 2003 - Bulletin of Symbolic Logic 9 (1):45-47.
Jeremy Avigad. Formalizing forcing arguments in subsystems of second-order arithmetic. Annals of pure and applied logic, vol. 82 , pp. 165–191. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Jeremy Avigad and Solomon Feferman. Gödel's functional (“Dialectica”) interpretation. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 337–405. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):469-470.
Analytics
Added to PP
2015-02-02
Downloads
4 (#1,644,260)
6 months
16 (#172,419)
2015-02-02
Downloads
4 (#1,644,260)
6 months
16 (#172,419)
Historical graph of downloads
Author's Profile
References found in this work
The unprovability of consistency: an essay in modal logic.George Boolos - 1979 - New York: Cambridge University Press.
Some theorems about the sentential calculi of Lewis and Heyting.J. C. C. McKinsey & Alfred Tarski - 1948 - Journal of Symbolic Logic 13 (1):1-15.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-grz79 uwo