The model-theoretic ordinal analysis of theories of predicative strength

Journal of Symbolic Logic 64 (1):327-349 (1999)
  Copy   BIBTEX

Abstract

We use model-theoretic methods described in [3] to obtain ordinal analyses of a number of theories of first- and second-order arithmetic, whose proof-theoretic ordinals are less than or equal to Γ0.

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
48 (#324,723)

6 months
4 (#800,606)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
Classical predicative logic-enriched type theories.Robin Adams & Zhaohui Luo - 2010 - Annals of Pure and Applied Logic 161 (11):1315-1345.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Systems of predicative analysis.Solomon Feferman - 1964 - Journal of Symbolic Logic 29 (1):1-30.
On the relationship between ATR 0 and.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768-779.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.

View all 6 references / Add more references