论文信息 - Subsets of models of arithmetic

Subsets of models of arithmetic

We define certain properties of subsets of models of arithmetic related to their codability in end extensions and elementary end extensions. We characterize these properties using some more familiar notions concerning cuts in models of arithmetic.

Roman Kossak | Jeffrey B. Paris

[1] Peter Clote,et al. Partition relations in arithmetic , 1985 .

[2] Marian Srebrny,et al. Set Theory and Hierarchy Theory V , 1977 .

[3] Jeff B. Paris,et al. Some conservation results for fragments of arithmetic , 1981 .

[4] Jeff B. Paris,et al. On the Existence of end Extensions of Models of Bounded Induction , 1989 .

[5] L. Kirby,et al. Indicators, recursive saturation and expandability , 1981 .

[6] Jeff B. Paris,et al. Initial segments of models of Peano's axioms , 1977 .

[7] J. Paris,et al. ∑n-Collection Schemas in Arithmetic , 1978 .

[8] Roman Kossak. On extensions of models of strong fragments of arithmetic , 1990 .