Subcountability under realizability

Notre Dame Journal of Formal Logic 27 (2):210-220 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093636613

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The completeness of provable realizability.G. E. Mints - 1989 - Notre Dame Journal of Formal Logic 30 (3):420-441.
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.
A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic.Mohammad Ardeshir, Erfan Khaniki & Mohsen Shahriari - 2019 - Notre Dame Journal of Formal Logic 60 (3):481-489.
Robert R. Tompkins. On Kleene's recursive realizability as an interpretation for intuitionistic elementary number theory. Notre Dame journal of formal logic, vol. 9 no. 4 , pp. 289–293. [REVIEW]R. E. Vesley - 1970 - Journal of Symbolic Logic 35 (3):475.
Infinite series of regressive isols under addition.Judith L. Gersting - 1977 - Notre Dame Journal of Formal Logic 18 (2):299-304.
On Goodman Realizability.Emanuele Frittaion - 2019 - Notre Dame Journal of Formal Logic 60 (3):523-550.
Book Review: Charles S. Chihara. A Structural Account of Mathematics. [REVIEW]Alan Baker - 2006 - Notre Dame Journal of Formal Logic 47 (3):435-442.
Review: McCarty, Richard, Kant's Theory of Action. [REVIEW]Patrick Frierson - 2010 - Notre Dame Philosophical Reviews 2010 (6).
Sobociński Bolesław. Remarks about axiomatizations of certain modal systems. Notre Dame journal of formal logic, vol. 5 no. 1 , pp. 71–80.Prior A. N., K1, K2 and related modal systems. Notre Dame journal of formal logic, vol. 5 no. 4 , pp. 299–304.Sobociński Bolesław. Modal system S4.4. Notre Dame journal of formal logic, vol. 5 no. 4 , pp. 305–312.Sobociński Bolesław. Family of the non-Lewis modal systems. Notre Dame journal of formal logic, vol. 5 no. 4 , pp. 313–318.Thomas Ivo. A theorem on S4.2 and S4.4. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 335–336.Thomas Ivo. Decision for K4. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 337–338. [REVIEW]G. F. Schumm - 1972 - Journal of Symbolic Logic 37 (1):182-183.
Henry C. Byerly and Charles J. Merchant. New algorithms for the statement and class calculi. Notre Dame journal of formal logic, vol. 11 , pp. 229–240. [REVIEW]Gerald Standley - 1974 - Journal of Symbolic Logic 39 (2):362.

Analytics

Added to PP
2010-08-24

Downloads
11 (#1,149,206)

6 months
3 (#1,208,233)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references