Journal of Symbolic Logic 44 (4):609-625 (1979)
Abstract |
We study topological constructions in the recursion theoretic framework of the lattice of recursively enumerable open subsets of a topological space X. Various constructions produce complemented recursively enumerable open sets with additional recursion theoretic properties, as well as noncomplemented open sets. In contrast to techniques in classical topology, we construct a disjoint recursively enumerable collection of basic open sets which cannot be extended to a recursively enumerable disjoint collection of basic open sets whose union is dense in X
|
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
DOI | 10.2307/2273299 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Automorphisms of the Lattice of Recursively Enumerable Vector Spaces.Iraj Kalantari - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (25-29):385-401.
Automorphisms of the Lattice of Recursively Enumerable Vector Spaces.Iraj Kalantari - 1979 - Mathematical Logic Quarterly 25 (25‐29):385-401.
Citations of this work BETA
Point-Free Topological Spaces, Functions and Recursive Points; Filter Foundation for Recursive Analysis. I.Iraj Kalantari & Lawrence Welch - 1998 - Annals of Pure and Applied Logic 93 (1-3):125-151.
Effective Topological Spaces II: A Hierarchy.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (2):207-224.
Effective Topological Spaces I: A Definability Theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-27.
Effective Topological Spaces III: Forcing and Definability.Iraj Kalantari & Galen Weitkamp - 1987 - Annals of Pure and Applied Logic 36:17-27.
Effective Inseparability in a Topological Setting.Dieter Spreen - 1996 - Annals of Pure and Applied Logic 80 (3):257-275.
View all 6 citations / Add more citations
Similar books and articles
Maximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces.Iraj Kalantari & Allen Retzlaff - 1977 - Journal of Symbolic Logic 42 (4):481-491.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Splitting Theorems for Speed-Up Related to Order of Enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
Degrees of Recursively Enumerable Topological Spaces.Iraj Kalantari & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (3):610-622.
On the Orbits of Hyperhypersimple Sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Simple and Hyperhypersimple Vector Spaces.Allen Retzlaff - 1978 - Journal of Symbolic Logic 43 (2):260-269.
Definable Structures in the Lattice of Recursively Enumerable Sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Some Modifications of Scott's Theorem on Injective Spaces.Andrzej W. Jankowski - 1986 - Studia Logica 45 (2):155 - 166.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Analytics
Added to PP index
2009-01-28
Total views
15 ( #698,074 of 2,507,714 )
Recent downloads (6 months)
2 ( #277,114 of 2,507,714 )
2009-01-28
Total views
15 ( #698,074 of 2,507,714 )
Recent downloads (6 months)
2 ( #277,114 of 2,507,714 )
How can I increase my downloads?
Downloads