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

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273461
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,480
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Boolean Pairs Formed by the Δn0-Sets.E. Herrmann - 1997 - Annals of Pure and Applied Logic 87 (2):145-149.

Add more citations

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.
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 index
2009-01-28

Total views
200 ( #41,903 of 2,330,659 )

Recent downloads (6 months)
2 ( #395,593 of 2,330,659 )

How can I increase my downloads?

Downloads

My notes