QE Rings in Characteristic p

, , , &
Journal of Symbolic Logic 50 (4):1080-1081 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273999

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Finite QE rings in characteristic p 2.Dan Saracino & Carol Wood - 1985 - Annals of Pure and Applied Logic 28 (1):13-31.
QE rings in characteristic p n.Chantal Berline & Gregory Cherlin - 1983 - Journal of Symbolic Logic 48 (1):140 - 162.
C. Berline and G. Cherlin. QE rings in characteristic p. Logic year 1979–80, The University of Connecticut, USA, edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture notes in mathematics, vol. 859, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 16–31. - C. Berline and G. Cherlin. QE nilrings of prime characteristic. Bulletin de la Société Mathématique de Belgique, ser. B vol. 33 , pp. 3–17. - Chantal Berline and Gregory Cherlin. QE rings in characteristic pn. The journal of symbolic logic, vol. 48 , pp. 140–162. - D. Saracino and C. Wood. QE commutative nilrings. The journal of symbolic logic, vol. 49 , pp. 644–651. [REVIEW]M. Boffa - 1985 - Journal of Symbolic Logic 50 (4):1080-1081.
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. - Jam. [REVIEW]Roman Kossak - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
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. - Jam. [REVIEW]Roman Kossak - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
omnibus Review. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
J. H. Schmerl, Subsets coded in elementary end extensions. Archive for Mathematical Logic, vol. 53 (2014), no. 5–6, pp. 571–581. - J. H. Schmerl, Minimal elementary end extensions. Archive for Mathematical Logic, vol. 56 (2017), no. 5–6, pp. 541–553. [REVIEW]Athar Abdul-Quader - 2019 - Bulletin of Symbolic Logic 25 (1):125-126.
Thephilosophyofautomatedtheoremproving.Francis Jeffry Pelletier - unknown
Review: Angus Macintyre, L. Pacholski, J. Wierzejewski, A. J. Wilkie, Ramsey Quantifiers in Arithmetic; James H. Schmerl, Stephen G. Simpson, On the Role of Ramsey Quantifiers in First Order Arithmetic; Carl Morgenstern, On Generalized Quantifiers in Arithmetic. [REVIEW]L. A. S. Kirby - 1985 - Journal of Symbolic Logic 50 (4):1078-1079.

Analytics

Added to PP
2017-02-21

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references