## A Model-Theoretic Approach to Ordinal Analysis (1997)

### Cached

### Download Links

- [ftp.math.ucla.edu]
- [math.stanford.edu]
- [www.andrew.cmu.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Bulletin of Symbolic Logic |

Citations: | 11 - 3 self |

### BibTeX

@ARTICLE{Avigad97amodel-theoretic,

author = {Jeremy Avigad and Richard Sommer},

title = {A Model-Theoretic Approach to Ordinal Analysis},

journal = {Bulletin of Symbolic Logic},

year = {1997},

volume = {3},

pages = {17--52}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We describe a model-theoretic approach to ordinal analysis via the finite combinatorial notion of an #-large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in nonstandard instances, give rise to models of the theory being analyzed. This method is applied to obtain ordinal analyses of a number of interesting subsystems of first- and second-order arithmetic. x1. Introduction. Two of proof theory's defining goals are the justification of classical theories on constructive grounds, and the extraction of constructive information from classical proofs. Since Gentzen, ordinal analysis has been a major component in these pursuits, and the assignment of recursive ordinals to theories has proven to be an illuminating way of measuring their constructive strength. The traditional approach to ordinal analysis, which uses cut-elimination procedures to transfor...