Abstract
Let ωe denote the e th r.e. subset of the natural numbers N, i.e. ωe = {x: φe(x) converges} where φe is the partial recursive function computed by the e th Turing machine. Then an r.e. set A is called nowhere simple if A is coinfinite and for any r.e. set W e, there exists an r.e. set W’e ⊆ W e such that W’e ⋂ A = Ø and card(W e − A) = ∞ if and only if card(W’e) = ∞. We say A is effectively nowhere simple if there is an effective procedure to find the index of such a W’e from e, i.e. if there is a recursive function f such that W f(e) = W’e. In this case, f is said to be a witness function for A. These classes of sets were introduced by Shore in [20] where he used them to investigate automorphism bases for ℒ(ω) (the lattice of r.e. sets) and ℒ*(ω) (ℒω) modulo finite sets). In particular he was able to give an easy proof of the main result of [19] that any nontrivial class of r.e. sets closed under recursive isomorphisms is an automorphism base for ℒ*(ω) using these sets. Subsequent to this paper, various investigations concerning automorphisms of ℒ(ω) and ℒ*(ω) have utilized properties of r.e. sets with rich lattices of supersets. For example, for effectively nowhere simple sets, Maass [11] proved that any two effectively nowhere simple sets have effectively isomorphic lattices of supersets. Another such property is the outer splitting property [11].
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The research of both authors was partly supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.
Partially supported by Cornell University and a U.S.A.-N.Z. binational grant.
Partially supported by NSF grant DMS 9006413.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ash, C.J. and R.G. Downey [1984], Decidable subspaces and recursively enumerable subspaces. J. Symbolic Logic, 49, 1137–1145.
Downey, R.G. [1983], Nowhere simplicity in matroids. J. Austral. Math. Soc. (Series A), 28–45.
Downey, R.G. [1983], On a question of A. Retzlaff. Z. Math. Logik Grund. Math, 379–384.
Downey, R.G. [1984], Co-immune subspaces and complementation in V ∞. J. Symbolic Logic, 49, 528–538.
Downey, R.G. [1984], A note on decompositions of recursively enumerable subspaces. Z. Math. Logik Grund. Math, 30, 465–470.
Downey, R.G. [1987], Orbits of creative subspaces. Proc. Amer. Math. Soc, 99, 163–170.
Downey, R.G. and J.B. Remmel [1987], Automorphisms and r.e. structures. Z. Math. Logik Grund. Math, 33, 339–345.
Downey, R.G. and J.B. Remmel, Effective algebras and relational systems: Coding properties. In preparation.
Downey, R.G., J.B. Remmel and L.V. Welch [1987], Degrees of bases and splittings of recursively enumerable subspaces. Trans. Amer. Math. Soc, 302, 683–714.
Guhl, R. [1973], Two Types of Recursively Enumerable Subspaces. Ph.D. Thesis, Rutgers University.
Maass, W. [1983], Characterizations of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable sets. Trans. Amer. Math. Soc, 279, 311–336.
Metakides, G. and A. Nerode [1977], Recursively enumerable vector spaces. Ann. Math. Logic, 11, 147–171.
Miller, D. and J.B. Remmel [1984], Effectively nowhere simple sets. J. Symbolic Logic, 49, 129–136.
Nerode, A. and J.B. Remmel [1982], Recursion theory on matroids. Patras Logic Symposion (ed. G. Metakides), North-Holland, Amsterdam, 129–136.
Nerode, A. and J.B. Remmel [1983], Recursion theory on Matroids, II. Southeast Asian Logic Conference (eds. C.T. Chong and M. Wicks), North-Holland, New York, 133–184.
Nerode, A. and J.B. Remmel [1985], A survey of the lattices of r.e. substructures. Recursion Theory (eds. A. Nerode and R.A. Shore), A.M.S. Publication, 323–376.
Remmel, J.B. [1980], On r.e. and co-r.e. vector spaces with non-extendible bases. J. Symbolic Logic, 45, 220–234.
Remmel, J.B. [1980], Recursion theory on algebraic structures with an independent set. Ann. Math. Logic, 18, 153–191.
Shore, R.A. [1977], Determining automorphisms of the recursively enumerable sets. Proc. A.M.S, 65, 318–326.
Shore, R.A. [1978], Nowhere simple sets and the lattice of recursively enumerable sets. J. Symbolic Logic, 43, 322–330.
Soare, R.I. [1987], Recursively Enumerable Sets and Degrees. Springer-Verlag (Berlin, Heidelberg, New York).
Stob, M. [1985], Major subsets and the lattice of recursively enumerable sets. Recursion Theory (eds. A. Nerode nad R.A. Shore), A.M.S. Publication, 107–116.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Downey, R.G., Remmel, J.B. (1993). Effectively and Noneffectively Nowhere Simple Subspaces. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds) Logical Methods. Progress in Computer Science and Applied Logic, vol 12. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0325-4_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0325-4_10
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6708-9
Online ISBN: 978-1-4612-0325-4
eBook Packages: Springer Book Archive