Abstract
Let I 0 be a a computable basis of the fully effective vector space V ∞ over the computable field F. Let I be a quasimaximal subset of I 0 that is the intersection of n maximal subsets of the same 1-degree up to *. We prove that the principal filter \({\mathcal{L}^{\ast}(V,\uparrow )}\) of V = cl(I) is isomorphic to the lattice \({\mathcal{L}(n, \overline{F})}\) of subspaces of an n-dimensional space over \({\overline{F}}\) , a \({\Sigma _{3}^{0}}\) extension of F. As a corollary of this and the main result of Dimitrov (Math Log 43:415–424, 2004) we prove that any finite product of the lattices \({(\mathcal{L}(n_{i}, \overline{F }_{i}))_{i=1}^{k}}\) is isomorphic to a principal filter of \({\mathcal{ L}^{\ast}(V_{\infty})}\) . We thus answer Question 5.3 “What are the principal filters of \({\mathcal{L}^{\ast}(V_{\infty}) ?}\) ” posed by Downey and Remmel (Computable algebras and closure systems: coding properties, handbook of recursive mathematics, vol 2, pp 977–1039, Stud Log Found Math, vol 139, North-Holland, Amsterdam, 1998) for spaces that are closures of quasimaximal sets.
Similar content being viewed by others
References
Aigner, M.: Combinatorial theory. Reprint of the 1979 original. Classics in Mathematics, viii+483 pp. Springer, Berlin (1997)
Dimitrov, R.D.: Computably Enumerable Vector Spaces, Dependence Relations, and Turing Degrees. Ph.D. Dissertation, The George Washington University (2002)
Dimitrov R.D.: Quasimaximality and principal filters isomorphism between \({\mathcal{E}^{\ast }}\) and \({\mathcal{L}^{\ast }(V_{\infty})}\) . Math. Log. 43, 415–424 (2004)
Downey, R. G.: Undecidability of \({\mathcal{L}(F_{\infty})}\) and other lattices of r.e. substructures. Ann. Pure Appl. Log. 32(1), 17–26 (1986); corr. ibid. 48, 299–301 (1990)
Downey, R.G., Remmel, J.B.: Computable algebras and closure systems: coding properties. Handbook of Recursive Mathematics, vol. 2, pp. 977–1039, Stud. Logic Found. Math., vol. 139. North-Holland, Amsterdam (1998)
Grätzer, G.: Lattice Theory. First Concepts and Distributive Lattices, W. H. Freeman and Co., San Francisco (1971)
Metakides G., Nerode A.: Recursively enumerable vector spaces. Ann. Math. Log. 11, 147–171 (1977)
Nerode, A., Remmel, J.: A survey of lattices of r.e. substructures, Recursion Theory (Proc. AMS-ASL Summer Inst., Ithaca, NY, June 28–July 16, 1982). In: Nerode, A., Shore, R.A. (eds.) Proc. Sympos. Pure Math., vol. 42, pp. 323–375. Amer. Math. Soc., Providence, RT (1985)
Rogers H. Jr: Theory of Recursive Functions and Effective Computability, 1st edn. McGraw-Hill, New York (1967)
Soare, R.I.: Recursively enumerable sets and degrees. A Study of Computable Functions and Computably Generated Sets. Perspect. Math. Log., Springer-Verlag, Berlin (1987)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dimitrov, R. A class of \({\Sigma _{3}^{0}}\) modular lattices embeddable as principal filters in \({\mathcal{L}^{\ast }(V_{\infty })}\) . Arch. Math. Logic 47, 111–132 (2008). https://doi.org/10.1007/s00153-008-0078-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-008-0078-2