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 [Book Review]

Journal of Symbolic Logic 35 (3):475 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270744

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

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.
Review: Robert R. Tompkins, On Kleene's Recursive Realizability as an Interpretation for Intuitionistic Elementary Number Theory. [REVIEW]R. E. Vesley - 1970 - Journal of Symbolic Logic 35 (3):475-475.
On Kleene's Recursive Realizability as an Interpretation for Intuitionistic Elementary Number Theory.R. E. Vesley - 1970 - Journal of Symbolic Logic 35 (3):475-475.
Realizing Brouwer's sequences.Richard E. Vesley - 1996 - Annals of Pure and Applied Logic 81 (1-3):25-74.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
A common axiom set for classical and intuitionistic plane geometry.Melinda Lombard & Richard Vesley - 1998 - Annals of Pure and Applied Logic 95 (1-3):229-255.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Stephen C. Kleene. Origins of recursive function theory. Annals of the history of computing, vol. 3 , pp. 52– 67. - Martin Davis. Why Gödel didn't have Church's thesis. Information and control, vol. 54 , pp. 3– 24. - Stephen C. Kleene. Reflections on Church's thesis. Notre Dame journal of formal logic, vol. 28 , pp. 490– 498. [REVIEW]Stewart Shapiro - 1990 - Journal of Symbolic Logic 55 (1):348-350.
Semantics-based Nonmonotonic Inference.Heinrich Wansing - 1995 - Notre Dame Journal of Formal Logic 36 (1):44-54.
Realization of analysis into explicit mathematics.Sergei Tupailo - 2001 - Journal of Symbolic Logic 66 (4):1848-1864.
On new theorems for elementary number theory.Albert A. Mullin - 1967 - Notre Dame Journal of Formal Logic 8 (4):353-356.
Strictly Primitive Recursive Realizability, II. Completeness with Respect to Iterated Reflection and a Primitive Recursive $\omega$ -Rule.Zlatan Damnjanovic - 1998 - Notre Dame Journal of Formal Logic 39 (3):363-388.
A highly efficient "transfinite recursive definitions" axiom for set theory.Robert S. Wolf - 1981 - Notre Dame Journal of Formal Logic 22 (1):63-75.
Realization of Analysis into Explicit Mathematics.Sergei Tupailo - 2001 - Journal of Symbolic Logic 66 (4):1848-1864.
Proof interpretations with truth.Jaime Gaspar & Paulo Oliva - 2010 - Mathematical Logic Quarterly 56 (6):591-610.

Analytics

Added to PP
2016-06-30

Downloads
35 (#433,400)

6 months
7 (#350,235)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references