Some Results on LΔmath image

Mathematical Logic Quarterly 47 (4):503-512 (2001)
  Copy   BIBTEX

Abstract

We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas.

Links

PhilArchive



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

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

Some Results on LΔ — n+1.Alejandro Fernández Margarit & F. Félix Lara Martin - 2001 - Mathematical Logic Quarterly 47 (4):503-512.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
Strengths and Weaknesses of LH Arithmetic.Chris Pollett & Randall Pruim - 2002 - Mathematical Logic Quarterly 48 (2):221-243.

Analytics

Added to PP
2017-02-17

Downloads
8 (#1,237,933)

6 months
1 (#1,428,112)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references