Logic year 1979-80, the University of Connecticut, USA

, & (eds.)
New York: Springer Verlag (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.A1.L28 vol. 859

ISBN(s)

0387107088

Links

PhilArchive



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

External links

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

Through your library

My notes

Chapters

Com 1 models of pouer to.  (pages 859--120)L. -Elementarily Equivalent
§ 1. Introduction After seeing the Sacks Density Theorem [Sa2], Shoenfield conjectured [Sh2] that the recursively enumerable (re) degrees R form a dense structure as an upper semi-lattice analogously as the rationals are a dense structure as a linearly. [REVIEW]  (pages 859--230)David P. Miller

Similar books and articles

Com 1 models of pouer to.L. -Elementarily Equivalent - 1981 - In Manuel Lerman, James Henry Schmerl & Robert Irving Soare (eds.), Logic year 1979-80, the University of Connecticut, USA. New York: Springer Verlag. pp. 859--120.
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.
§ 1. Introduction After seeing the Sacks Density Theorem [Sa2], Shoenfield conjectured [Sh2] that the recursively enumerable (re) degrees R form a dense structure as an upper semi-lattice analogously as the rationals are a dense structure as a linearly. [REVIEW]David P. Miller - 1981 - In Manuel Lerman, James Henry Schmerl & Robert Irving Soare (eds.), Logic year 1979-80, the University of Connecticut, USA. New York: Springer Verlag. pp. 859--230.
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.
Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 , pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 , pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 , pp. 617–666. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
[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.
Lerman Manuel. Degrees of unsolvability. Local and global theory. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, xiii + 307 pp. [REVIEW]Carl G. Jockusch - 1985 - Journal of Symbolic Logic 50 (2):549-550.
Proceedings from 5th Scandinavian Logic Symposium, Aalborg, 17-19 January 1979.Finn V. Jensen, B. H. Mayoh & Karen K. Møller (eds.) - 1979 - Aalborg: distruberet af Aalborg Universitetsforlag.

Analytics

Added to PP
2009-01-28

Downloads
5 (#1,558,750)

6 months
4 (#1,004,582)

Historical graph of downloads
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