A recursive model for arithmetic with weak induction

Journal of Symbolic Logic 50 (1):49-54 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 79,857

External links

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

Through your library

Similar books and articles

On a Theory for AC0 and the Strength of the Induction Scheme.Satoru Kuroda - 1998 - Mathematical Logic Quarterly 44 (3):417-426.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Asymmetric Interpretations for Bounded Theories.Andrea Cantini - 1996 - Mathematical Logic Quarterly 42 (1):270-288.
On Herbrand consistency in weak arithmetic.Zofia Adamowicz & Paweł Zbierski - 2001 - Archive for Mathematical Logic 40 (6):399-413.
L i D Z λ as a basis for PRA.Uwe Petersen - 2003 - Archive for Mathematical Logic 42 (7):665-694.
LiDZλ as a basis for PRA.Uwe Petersen - 2003 - Archive for Mathematical Logic 42 (7):665-694.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
An Independence Result on Weak Second Order Bounded Arithmetic.Satoru Kuroda - 2001 - Mathematical Logic Quarterly 47 (2):183-186.
On some formalized conservation results in arithmetic.P. Clote, P. Hájek & J. Paris - 1990 - Archive for Mathematical Logic 30 (4):201-218.

Analytics

Added to PP
2009-01-28

Downloads
34 (#357,863)

6 months
1 (#479,585)

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