- 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
Relativized realizability in intuitionistic arithmetic of all finite types
Journal of Symbolic Logic 43 (1):23-44 (1978)
Abstract
This article has no associated abstract. (fix it)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
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Models of intuitionistic TT and N.Daniel Dzierzgowski - 1995 - Journal of Symbolic Logic 60 (2):640-653.
Finite sets and natural numbers in intuitionistic TT without extensionality.Daniel Dzierzgowski - 1998 - Studia Logica 61 (3):417-428.
A negationless interpretation of intuitionistic theories. II.Victor N. Krivtsov - 2000 - Studia Logica 65 (1-2):155-179.
A Realizability Interpretation for Classical Arithmetic.Jeremy Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):439-440.
Classical arithmetic as part of intuitionistic arithmetic.Michael Potter - 1998 - Grazer Philosophische Studien 55 (1):127-41.
Epistemic arithmetic is a conservative extension of intuitionistic arithmetic.Nicolas D. Goodman - 1984 - Journal of Symbolic Logic 49 (1):192-203.
Flagg realizability in arithmetic.Nicolas D. Goodman - 1986 - Journal of Symbolic Logic 51 (2):387-392.
Analytics
Added to PP
2009-01-28
Downloads
118 (#152,745)
6 months
10 (#276,350)
2009-01-28
Downloads
118 (#152,745)
6 months
10 (#276,350)
Historical graph of downloads
Citations of this work
Proof-theoretical analysis: weak systems of functions and classes.L. Gordeev - 1988 - Annals of Pure and Applied Logic 38 (1):1-121.
Some results on cut-elimination, provable well-orderings, induction and reflection.Toshiyasu Arai - 1998 - Annals of Pure and Applied Logic 95 (1-3):93-184.
A semantical proof of De Jongh's theorem.Jaap van Oosten - 1991 - Archive for Mathematical Logic 31 (2):105-114.
An intuitionistic fixed point theory.Wilfried Buchholz - 1997 - Archive for Mathematical Logic 37 (1):21-27.
Remarks on Herbrand normal forms and Herbrand realizations.Ulrich Kohlenbach - 1992 - Archive for Mathematical Logic 31 (5):305-317.
References found in this work
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-5ff6c685cb-dmxst uwo