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

R. E. Vesley

doi:10.2307/2270744

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)

Abstract	This article has no associated abstract. (fix it)
Keywords	No keywords specified (fix it)
Categories	Logic and Philosophy of Logic (categorize this paper)
DOI	10.2307/2270744
Options	Edit this record Mark as duplicate Export citation Find it on Scholar Request removal from index Revision history

Download options

PhilArchive copy

Upload a copy of this paper Check publisher's policy Papers currently archived: 68,975

External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)

Through your library

Sign in / register and customize your OpenURL resolver..
Configure custom resolver

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

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 index
2016-06-30

Total views
25 ( #452,893 of 2,498,296 )

Recent downloads (6 months)
1 ( #426,910 of 2,498,296 )

How can I increase my downloads?

Downloads