Abstract
Let\(\mathfrak{M}\) be the Medvedev lattice: this paper investigates some filters and ideals (most of them already introduced by Dyment, [4]) of\(\mathfrak{M}\). If\(\mathfrak{G}\) is any of the filters or ideals considered, the questions concerning\(\mathfrak{G}\) which we try to answer are: (1) is\(\mathfrak{G}\) prime? What is the cardinality of\({\mathfrak{M} \mathord{\left/ {\vphantom {\mathfrak{M} \mathfrak{G}}} \right. \kern-\nulldelimiterspace} \mathfrak{G}}\)? Occasionally, we point out some general facts on theT-degrees or the partial degrees, by which these questions can be answered.
Similar content being viewed by others
References
Balbes, R., Dwinger, P.: Distributive lattices. Columbia, MO: University of Missouri Press 1974
Case, J.: Enumeration reducibility and partial degrees. Ann. Math. Logic2, 419–439 (1971)
Cooper, S.B.: Partial degrees and the density problem. J. Symb. Logic47, 854–859 (1982)
Dyment, E.Z.: Certain properties of the Medvedev lattice. Mat. Sb. Nov. Ser.101 (143), 360–379 (1976) (Russian)
Gutteridge, L.: Some results on enumeration reducibility. Ph. D. thesis: Simon Fraser University 1971
Jockush, C.G. Jr., Posner, D.: Automorphism bases for degrees of unsolvability. Isr. J. Math.40, 150–164 (1981)
Lacombe, D.: Sur le semi-réseau constitué par les degrès d'indecidabilité récursive. C.R. Acad. Sci. Paris239, 1108–1109 (1954)
Lachlan, A.H., Lebeuf, R.: Countable initial segments of the degrees of unsolvability. J. Symb. Logic41, 289–300 (1976)
Lerman, M.: Degrees of unsolvability. Berlin Heidelberg New York: Springer 1985
Martin, D.A.: Measure, category, and degrees of unsolvability. (Unpublished, 1967)
McEvoy, K.: Jumps of quasi-minimale-degrees. J. Symb. Logic50, 389–394 (1985)
Medvedev, Ju.T.: Degrees of difficulty of the mass problems. Dokl. Akad. Nauk SSSR104, 501–504 (1955) (Russian)
Rogers, H. Jr.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967
Sorbi, A.: Some remarks on the algebraic structure of the Medvedev lattice. (To appear in J. Symb. Logic)
Sorbi, A.: Embedding Brouwer algebras in the Medvedev lattice. (To appear in Notre Dame J. Formal Logic)
Sorbi, A.: Some quotient lattices of the Medvedev lattice. (To appear in Z. Math. Logik Grundlagen Math.)
Yates, C.E.M.: Banach-Mazur games, comeager sets, and degrees of unsolvability. Math. Proc. Camb. Philos. Soc.79, 195–220 (1976)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sorbi, A. On some filters and ideals of the Medvedev lattice. Arch Math Logic 30, 29–48 (1990). https://doi.org/10.1007/BF01793784
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01793784