On elementary theories of some lattices or α-recursively enumerable sets

Annals of Mathematical Logic 14 (3):227-272 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(78)90020-7

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,518

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

Ideals of Generalized Finite Sets in Lattices of α‐Recursively Enumerable Sets.Manuel Lerman - 1976 - Mathematical Logic Quarterly 22 (1):347-352.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets.Manuel Lerman - 1976 - Journal of Symbolic Logic 41 (2):405-418.
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.Robert I. Soare - 1982 - Annals of Mathematical Logic 22 (1):69.
The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.
The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
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.
Nonisomorphism of lattices of recursively enumerable sets.John Todd Hammond - 1993 - Journal of Symbolic Logic 58 (4):1177-1188.
Representability of recursively enumerable sets in formal theories.J. C. Shepherdson - 1961 - Archive for Mathematical Logic 5 (3-4):119-127.

Analytics

Added to PP
2014-01-17

Downloads
20 (#1,052,675)

6 months
4 (#1,279,871)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The ∀∃ theory of peano σ1 sentences.Per Lindström & V. Yu Shavrukov - 2008 - Journal of Mathematical Logic 8 (2):251-280.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Recursion, metarecursion, and inclusion.James C. Owings - 1967 - Journal of Symbolic Logic 32 (2):173-179.
Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
Types of simple α-recursively enumerable sets.Manuel Lerman - 1976 - Journal of Symbolic Logic 41 (2):419-426.

View all 11 references / Add more references