Omitting the replacement schema in recursive arithmetic

Notre Dame Journal of Formal Logic 8:234 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093956089

Links

PhilArchive



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

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

Omitting the replacement schema in recursive arithmetic.I. J. Heath - 1967 - Notre Dame Journal of Formal Logic 8 (3):234-238.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
A note on omitting the replacement schema.A. Bundy - 1973 - Notre Dame Journal of Formal Logic 14 (1):118-120.
Expansions, omitting types, and standard systems.Fredrik Engström - 2004 - Dissertation, Chalmers
The Substitution Schema in Recursive Arithmetic.R. D. Lee - 1967 - Journal of Symbolic Logic 32 (4):543-543.
Review: R. D. Lee, The Substitution Schema in Recursive Arithmetic. [REVIEW]H. E. Rose - 1967 - Journal of Symbolic Logic 32 (4):543-543.
The substitution schema in recursive arithmetic.R. D. Lee - 1965 - Notre Dame Journal of Formal Logic 6 (3):193-200.
Weak theories of nonstandard arithmetic and analysis.Jeremy Avigad - manuscript
On the limit existence principles in elementary arithmetic and Σ n 0 -consequences of theories.Lev D. Beklemishev & Albert Visser - 2005 - Annals of Pure and Applied Logic 136 (1-2):56-74.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Recursive Models and the Divisibility Poset.James H. Schmerl - 1998 - Notre Dame Journal of Formal Logic 39 (1):140-148.
On the Difficulty of Writing Out formal Proofs in Arithmetic.Ryo Kashima & Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (3):328-332.
Lee R. D.. The substitution schema in recursive arithmetic. Notre Dame journal of formal logic, vol. 6 no. 3 , pp. 193–200. [REVIEW]H. E. Rose - 1968 - Journal of Symbolic Logic 32 (4):543-543.
Intuitionistic Choice and Restricted Classical Logic.Ulrich Kohlenbach - 2001 - Mathematical Logic Quarterly 47 (4):455-460.
Intuitionistically provable recursive well-orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.

Analytics

Added to PP
2017-02-20

Downloads
15 (#929,240)

6 months
1 (#1,506,218)

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