- 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
A semantics of evidence for classical arithmetic
Journal of Symbolic Logic 60 (1):325-337 (1995)
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
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness.Federico Aschieri - 2013 - Annals of Pure and Applied Logic 164 (6):591-617.
Intuitionistic Choice and Restricted Classical Logic.Ulrich Kohlenbach - 2001 - Mathematical Logic Quarterly 47 (4):455-460.
The classical and the ω-complete arithmetic.C. Ryll-Nardzewski, Andrzej Grzegorczyk & Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (2):188-206.
A Realizability Interpretation For Classical Arithmetic. [REVIEW]Ulrich Berger - 2002 - Bulletin of Symbolic Logic 8 (3):439-439.
Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
Interpreting Classical Theories in Constructive Ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
Review: Jeremy Avigad, A Realizability Interpretation for Classical Arithmetic. [REVIEW]Ulrich Berger - 2002 - Bulletin of Symbolic Logic 8 (3):439-440.
Grzegorczyk A., Mostowski A., and Ryll-Nardzewski C.. The classical and the ω-complete arithmetic. [REVIEW]Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (1):80-81.
A Hyperintensional Logic of Non-prime Evidence.Pietro Vigiani - 2024 - Journal of Philosophical Logic 53 (3):761-788.
Realizability semantics for quantified modal logic: Generalizing flagg’s 1985 construction.Benjamin G. Rin & Sean Walsh - 2016 - Review of Symbolic Logic 9 (4):752-809.
Analytics
Added to PP
2009-01-28
Downloads
68 (#233,803)
6 months
8 (#506,022)
2009-01-28
Downloads
68 (#233,803)
6 months
8 (#506,022)
Historical graph of downloads
Author's Profile
Citations of this work
Gödel's reformulation of Gentzen's first consistency proof for arithmetic: The no-counterexample interpretation.W. W. Tait - 2005 - Bulletin of Symbolic Logic 11 (2):225-238.
Games with 1-backtracking.Stefano Berardi, Thierry Coquand & Susumu Hayashi - 2010 - Annals of Pure and Applied Logic 161 (10):1254-1269.
Classical proof forestry.Willem Heijltjes - 2010 - Annals of Pure and Applied Logic 161 (11):1346-1366.
Herbrand's theorem as higher order recursion.Bahareh Afshari, Stefan Hetzl & Graham E. Leigh - 2020 - Annals of Pure and Applied Logic 171 (6):102792.
References found in this work
The Collected Papers of Gerhard Gentzen.K. Schütte - 1972 - Journal of Symbolic Logic 37 (4):752-753.
On the Original Gentzen Consistency Proof for Number Theory.Paul Bernays, A. Kino, J. Myhill & R. E. Vesley - 1975 - Journal of Symbolic Logic 40 (1):95-95.
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-6686886f5-kkm7k uwo