- 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
The completeness of provable realizability
Notre Dame Journal of Formal Logic 30 (3):420-441 (1989)
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
Halldén-completeness by gluing of Kripke frames.J. F. A. K. van Benthem & I. L. Humberstone - 1983 - Notre Dame Journal of Formal Logic 24 (4):426-430.
Subcountability under realizability.Charles McCarty - 1986 - Notre Dame Journal of Formal Logic 27 (2):210-220.
On provable recursive functions.H. B. Enderton - 1968 - Notre Dame Journal of Formal Logic 9 (1):86-88.
Provable forms of Martin's axiom.Gary P. Shannon - 1990 - Notre Dame Journal of Formal Logic 31 (3):382-388.
Provable fixed points in ${\rm I}\Delta0+\Omega1$.Alessandra Carbone - 1991 - Notre Dame Journal of Formal Logic 32 (4):562-572.
Reverse Mathematics and Uniformity in Proofs without Excluded Middle.Jeffry L. Hirst & Carl Mummert - 2011 - Notre Dame Journal of Formal Logic 52 (2):149-162.
On Kleene's recursive realizability as an interpretation for intuitionistic elementary number theory.Robert R. Tompkins - 1968 - Notre Dame Journal of Formal Logic 9 (4):289-293.
The completeness of Stoic propositional logic.Ian Mueller - 1979 - Notre Dame Journal of Formal Logic 20 (1):201-215.
The completeness of combinatory logic with discriminators.John T. Kearns - 1973 - Notre Dame Journal of Formal Logic 14 (3):323-330.
A completeness theorem for dynamic logic.László Csirmaz - 1985 - Notre Dame Journal of Formal Logic 26 (1):51-60.
Analytics
Added to PP
2010-08-24
Downloads
1 (#1,913,683)
6 months
17 (#161,763)
2010-08-24
Downloads
1 (#1,913,683)
6 months
17 (#161,763)
Historical graph of downloads
Citations of this work
The emptiness problem for intersection types.Paweł Urzyczyn - 1999 - Journal of Symbolic Logic 64 (3):1195-1215.
Proof-functional connectives and realizability.Franco Barbanera & Simone Martini - 1994 - Archive for Mathematical Logic 33 (3):189-211.
The "Relevance" of Intersection and Union Types.Mariangiola Dezani-Ciancaglini, Silvia Ghilezan & Betti Venneri - 1997 - Notre Dame Journal of Formal Logic 38 (2):246-269.
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-lc8fp uwo