6 results
A transfinite version of Puiseux's theorem, with applications to real closed fields
-
-
- Book:
- Logic Colloquium '90
- Published online:
- 24 March 2017
- Print publication:
- 02 March 2017, pp 250-258
-
- Chapter
- Export citation
Stretchings
-
- Journal:
- The Journal of Symbolic Logic / Volume 61 / Issue 2 / June 1996
- Published online by Cambridge University Press:
- 12 March 2014, pp. 563-585
- Print publication:
- June 1996
-
- Article
- Export citation
Every real closed field has an integer part
-
- Journal:
- The Journal of Symbolic Logic / Volume 58 / Issue 2 / June 1993
- Published online by Cambridge University Press:
- 12 March 2014, pp. 641-647
- Print publication:
- June 1993
-
- Article
- Export citation
Formal languages defined by the underlying structure of their words
-
- Journal:
- The Journal of Symbolic Logic / Volume 53 / Issue 4 / December 1988
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1009-1026
- Print publication:
- December 1988
-
- Article
- Export citation
Jon Barwise and John Schlipf. On recursively saturated models of arithmetic. Model theory and algebra, A memorial tribute to Abraham Robinson, edited by D. H. Saracino and V. B. Weispfenning, Lecture notes in mathematics, vol. 498, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 42–55. - Patrick Cegielski, Kenneth McAloon, and George Wilmers. Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edited by D. van Dalen, D. Lascar, and T. J. Smiley, Studies in logic and the foundations of mathematics, vol. 108, North-Holland Publishing Company, Amsterdam, New York, and London, 1982, pp. 57–68. - Julia F. Knight. Theories whose resplendent models are homogeneous. Israel journal of mathematics, vol. 42 (1982), pp. 151–161. - Julia Knight and Mark Nadel. Expansions of models and Turing degrees. The journal of symbolic logic, vol. 47 (1982), pp. 587–604. - Julia Knight and Mark Nadel. Models of arithmetic and closed ideals. The journal of symbolic logic, vol. 47 no. 4 (for 1982, pub. 1983), pp. 833–840. - Henryk Kotlarski. On elementary cuts in models of arithmetic. Fundamenta mathematicae, vol. 115 (1983), pp. 27–31. - H. Kotlarski, S. Krajewski, and A. H. Lachlan. Construction of satisfaction classes for nonstandard models. Canadian mathematical bulletin—Bulletin canadien de mathématiques, vol. 24 (1981), pp. 283–293. - A. H. Lachlan. Full satisfaction classes and recursive saturation. Canadian mathematical bulletin—Bulletin canadien de mathématiques, pp. 295–297. - Leonard Lipshitz and Mark Nadel. The additive structure of models of arithmetic. Proceedings of the American Mathematical Society, vol. 68 (1978), pp. 331–336. - Mark Nadel. On a problem of MacDowell and Specker. The journal of symbolic logic, vol. 45 (1980), pp. 612–622. - C. Smoryński. Back-and-forth inside a recursively saturated model of arithmetic. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edited by D. van Dalen, D. Lascar, and T. J. Smiley, Studies in logic and the foundations of mathematics, vol. 108, North-Holland Publishing Company, Amsterdam, New York, and London, 1982, pp. 273–278. - C. Smoryński and J. Stavi. Cofinal extension preserves recursive saturation. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7,1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 338–345. - George Wilmers. Minimally saturated models. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 370–380.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 1 / March 1987
- Published online by Cambridge University Press:
- 12 March 2014, pp. 279-284
- Print publication:
- March 1987
-
- Article
- Export citation
Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9(1976), pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 (1976), pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 (1976), pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 (1976), vol. 43 (1978), pp. 572–600.
-
- Journal:
- The Journal of Symbolic Logic / Volume 48 / Issue 2 / June 1983
- Published online by Cambridge University Press:
- 12 March 2014, pp. 484-485
- Print publication:
- June 1983
-
- Article
- Export citation