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: 93,774

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

Analytics

Added to PP
2013-12-01

Downloads
36 (#119,765)

6 months
15 (#941,355)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Felicity Martin
University of Sydney

References found in this work

No references found.

Add more references