On certain types and models for arithmetic
Journal of Symbolic Logic 39 (1):151-162 (1974)
| Abstract | There is an analogy between concepts such as end-extension types and minimal types in the model theory of Peano arithmetic and concepts such as P-points and selective ultrafilters in the theory of ultrafilters on N. Using the notion of conservative extensions of models, we prove some theorems clarifying the relation between these pairs of analogous concepts. We also use the analogy to obtain some model-theoretic results with techniques originally used in ultrafilter theory. These results assert that every countable nonstandard model of arithmetic has a bounded minimal extension and that some types in arithmetic are not 2-isolated | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAlistair H. Lachlan & Robert I. Soare (1994). Models of Arithmetic and Upper Bounds for Arithmetic Sets. Journal of Symbolic Logic 59 (3):977-983.
M. Krynicki & K. Zdanowski (2005). Theories of Arithmetics in Finite Models. Journal of Symbolic Logic 70 (1):1-28.
C. Ward Henson, Matt Kaufmann & H. Jerome Keisler (1984). The Strength of Nonstandard Methods in Arithmetic. Journal of Symbolic Logic 49 (4):1039-1058.
Joseph Barback (1994). Torre Models in the Isols. Journal of Symbolic Logic 59 (1):140-150.
George Mills & Jeff Paris (1984). Regularity in Models of Arithmetic. Journal of Symbolic Logic 49 (1):272-280.
Richard Kaye (1991). Model-Theoretic Properties Characterizing Peano Arithmetic. Journal of Symbolic Logic 56 (3):949-963.
Andreas Blass (1977). Amalgamation of Nonstandard Models of Arithmetic. Journal of Symbolic Logic 42 (3):372-386.
George Mills (1978). A Model of Peano Arithmetic with No Elementary End Extension. Journal of Symbolic Logic 43 (3):563-567.
Kenneth McAloon (1982). On the Complexity of Models of Arithmetic. Journal of Symbolic Logic 47 (2):403-415.
Fred G. Abramson & Leo A. Harrington (1978). Models Without Indiscernibles. Journal of Symbolic Logic 43 (3):572-600.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,602 of 549,017 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
