Orbits of hyperhypersimple sets and the lattice of ∑03 sets

Journal of Symbolic Logic 48 (3):693 - 699 (1983)
  Copy   BIBTEX

Abstract

It will be shown that in the lattice of recursively enumerable sets all lattices $\underline{L}(X)$ are elementarily definable with parameters, where X is Σ 0 3 and $\underline{L}^3(X)$ consists of all Σ 0 3 sets containing X

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

Similar books and articles

Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Simple and hyperhypersimple vector spaces.Allen Retzlaff - 1978 - Journal of Symbolic Logic 43 (2):260-269.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.

Analytics

Added to PP
2009-01-28

Downloads
215 (#89,476)

6 months
13 (#165,103)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Boolean pairs formed by the< i> Δ_< sub> n< sup> 0-sets.E. Herrmann - 1997 - Annals of Pure and Applied Logic 87 (2):145-149.
Boolean pairs formed by the Δn0-sets.E. Herrmann - 1997 - Annals of Pure and Applied Logic 87 (2):145-149.

Add more citations

References found in this work

No references found.

Add more references