Ultrafilters and types on models of arithmetic
暂无分享,去创建一个
[1] J. Paris,et al. ∑n-Collection Schemas in Arithmetic , 1978 .
[2] A. Blass. End extensions, conservative extensions, and the Rudin-Frolík ordering , 1977 .
[3] R. G. Phillips. Omitting types in arithmetic and conservative extensions , 1974 .
[4] Per Lindström. Remarks on Some Theorems of Keisler , 1968, J. Symb. Log..
[5] David Booth,et al. Ultrafilters on a countable set , 1970 .
[6] Andreas Blass. On Certain Types and Models for Arithmetic , 1974, J. Symb. Log..
[7] Carl G. Jockusch,et al. Ramsey's theorem and recursion theory , 1972, Journal of Symbolic Logic.
[8] Daniel Lascar,et al. Ranks and definability in superstable theories , 1976 .
[9] L. A. S. Kirby,et al. Flipping properties in arithmetic , 1982, Journal of Symbolic Logic.
[10] Bruno Poizat,et al. An Introduction to Forking , 1979, J. Symb. Log..
[11] Haim Gaifman,et al. Models and types of Peano's arithmetic , 1976 .
[12] Peter Clote,et al. Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic , 1983, Journal of Symbolic Logic.
[13] Andreas Blass. The Rudin-Keisler ordering of $P$-points , 1973 .
[14] Jeff B. Paris,et al. Initial segments of models of Peano's axioms , 1977 .