Some Results on LΔ — n+1

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: 74,429

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

A Note on Finiteness in the Predicative Foundations of Arithmetic.Fernando Ferreira - 1999 - Journal of Philosophical Logic 28 (2):165-174.
Predicative Fragments of Frege Arithmetic.Øystein Linnebo - 2004 - Bulletin of Symbolic Logic 10 (2):153-174.
On the Induction Schema for Decidable Predicates.Lev D. Beklemishev - 2003 - Journal of Symbolic Logic 68 (1):17-34.
Models Without Indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Dynamic Ordinal Analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.
Kreisel's Conjecture with Minimality Principle.Pavel Hrubeš - 2009 - Journal of Symbolic Logic 74 (3):976-988.
Reflection Principles in Fragments of Peano Arithmetic.Hiroakira Ono - 1987 - Mathematical Logic Quarterly 33 (4):317-333.
The Shortest Definition of a Number in Peano Arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.
Minimal Truth and Interpretability.Martin Fischer - 2009 - Review of Symbolic Logic 2 (4):799-815.

Analytics

Added to PP
2013-12-01

Downloads
18 (#607,714)

6 months
1 (#416,470)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references