No CrossRef data available.
Article contents
James H. Schmerl. Peano models with many generic classes. Pacific Journal of Mathematics, vol. 43 (1973), pp. 523–536. - James H. Schmerl. Correction to: “Peano models with many generic classes”. Pacific Journal of Mathematics, vol. 92 (1981), no. 1, pp. 195–198. - James H. Schmerl. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80 (Proceedings, Seminars, and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80). edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture Notes in Mathematics, vol. 859. Springer, Berlin, pp. 268–282. - James H. Schmerl. Recursively saturatedmodels generated by indiscernibles. Notre Dane Journal of Formal Logic, vol. 26 (1985), no. 1, pp. 99–105. - James H. Schmerl. Large resplendent models generated by indiscernibles. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1382–1388. - James H. Schmerl. Automorphism groups of models of Peano arithmetic. The Journal of Symbolic Logic, vol. 67 (2002), no. 4, pp. 1249–1264. - James H. Schmerl. Diversity in substructures. Nonstandard models of arithmetic and set theory. edited by A. Enayat and R. Kossak, Contemporary Mathematics, vol. 361, American Mathematical Societey (2004), pp. 45–161. - James H. Schmerl. Generic automorphisms and graph coloring. Discrete Mathematics, vol. 291 (2005), no. 1–3, pp. 235–242. - James H. Schmerl. Nondiversity in substructures. The Journal of Symbolic Logic, vol. 73 (2008), no. 1, pp. 193–211.
Published online by Cambridge University Press: 15 January 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Reviews
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2009
References
Schmerl, James H.. Peano models with many generic classes. Pacific Journal of Mathematics, vol. 43 (1973), pp. 523–536.CrossRefGoogle Scholar
Schmerl, James H.. Correction to: “Peano models with many generic classes”. Pacific Journal of Mathematics, vol. 92 (1981), no. 1, pp. 195–198.Google Scholar
Schmerl, James H.. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80 (Proceedings, Seminars, and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80). edited by Lerman, M., Schmerl, J. H., and Soare, R. I., Lecture Notes in Mathematics, vol. 859. Springer, Berlin, pp. 268–282.Google Scholar
Schmerl, James H.. Recursively saturated models generated by indiscernibles. Notre Dame Journal of Formal Logic, vol. 26 (1985), no. 1, pp. 99–105.Google Scholar
Schmerl, James H.. Large resplendent models generated by indiscernibles. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1382–1388.Google Scholar
Schmerl, James H.. Automorphism groups of models of Peano arithmetic. The Journal of Symbolic Logic, vol. 67 (2002), no. 4, pp. 1249–1264.Google Scholar
Schmerl, James H.. Diversity in substructures. Nonstandard models of arithmetic and set theory. edited by Enayat, A. and Kossak, R., Contemporary Mathematics, vol. 361, American Mathematical Societey (2004), pp. 45–161.Google Scholar
Schmerl, James H.. Generic automorphisms and graph coloring. Discrete Mathematics, vol. 291 (2005), no. 1–3, pp. 235–242.Google Scholar
Schmerl, James H.. Nondiversity in substructures. The Journal of Symbolic Logic, vol. 73 (2008), no. 1, pp. 193–211.Google Scholar