{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:56:13Z","timestamp":1648868173315},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T00:00:00Z","timestamp":1127779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s00153-005-0278-y","type":"journal-article","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T12:17:55Z","timestamp":1127823475000},"page":"179-190","source":"Crossref","is-referenced-by-count":13,"title":["The Medvedev lattice of computably closed sets"],"prefix":"10.1007","volume":"45","author":[{"given":"Sebastiaan A.","family":"Terwijn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,27]]},"reference":[{"key":"278_CR1","unstructured":"Balbes, R., Dwinger, P.: Distributive lattices. University of Missouri Press, 1974"},{"key":"278_CR2","doi-asserted-by":"crossref","unstructured":"Binns, S.: A splitting theorem for the Medvedev and Muchnik lattices. Mathematical Logic Quarterly 49, 327\u2013335 (2003)","DOI":"10.1002\/malq.200310034"},{"key":"278_CR3","doi-asserted-by":"crossref","unstructured":"Binns, S, Simpson, S. G.: Embeddings into the Medvedev and Muchnik lattices of \u03a001 classes. Archive for Mathematical Logic 43, 399\u2013414 (2004)","DOI":"10.1007\/s00153-003-0195-x"},{"key":"278_CR4","unstructured":"Cenzer, D.: \u03a001 classes in computability theory. Handbook of computability theory, Studies in Logic and the Foundations of Mathematics 140, North-Holland, Amsterdam, 1999 pp. 37\u201385"},{"key":"278_CR5","doi-asserted-by":"crossref","unstructured":"Cenzer, D., Hinman, P.: Density of the Medvedev lattice of \u03a001 classes, Archive for Mathematical Logic 42 (6), 583\u2013600 (2003)","DOI":"10.1007\/s00153-002-0166-7"},{"key":"278_CR6","doi-asserted-by":"crossref","unstructured":"Jankov, A.V.: Calculus of the weak law of the excluded middle. Izv. Akad. Nauk SSSR Ser. Mat. 32, 1044\u20131051 (1968) (In Russian.)","DOI":"10.1070\/IM1968v002n05ABEH000690"},{"key":"278_CR7","doi-asserted-by":"crossref","unstructured":"Jockusch, C. G. Jr, McLaughlin, T. G.: Countable retracing functions and \u03a002 predicates. Pacific Journal of Mathematics 30, 67\u201393 (1969)","DOI":"10.2140\/pjm.1969.30.67"},{"key":"278_CR8","doi-asserted-by":"crossref","unstructured":"Carl J. G., Jr., Robert Soare, I.: Degrees of members of \u03a001 classes. Pacific Journal of Mathematics 40 (3), 605\u2013616 (1972)","DOI":"10.2140\/pjm.1972.40.605"},{"key":"278_CR9","unstructured":"Jockusch, C. G. Jr, Soare, R. I.: \u03a001 classes and degrees of theories, Transactions of the American Mathematical Society 173, 35\u201356 (1972)"},{"key":"278_CR10","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, A.: Measure, \u03a010-classes and complete extensions of PA. In: H.-D. Ebbinghaus, G. H. M\u00fcller, and G. E. Sacks (eds), Recursion theory week, Lect. Notes in Math. 1141, Springer-Verlag, 1985, pp. 245\u2013259","DOI":"10.1007\/BFb0076224"},{"key":"278_CR11","unstructured":"Medvedev, Yu. T., Degrees of difficulty of the mass problems. Dokl. Akad. Nauk. SSSR 104 (4), 501\u2013504 (1955)"},{"key":"278_CR12","unstructured":"Medvedev, Yu. T.: Finite problems. Dokl. Akad. Nauk. SSSR (NS) 142 (5), 1015\u20131018 (1962)"},{"key":"278_CR13","unstructured":"Muchnik, A. A.: On strong and weak reducibility of algorithmic problems. Sibirsk. Math. Zh 4, 1328\u20131341 (1963)"},{"key":"278_CR14","unstructured":"Odifreddi, P. G.: Classical recursion theory Vol. I. Studies in logic and the foundations of mathematics 125, North-Holland, 1989"},{"key":"278_CR15","unstructured":"Odifreddi, P. G.: Classical Recursion Theory Vol. II. Studies in logic and the foundations of mathematics 143, North-Holland, 1999"},{"key":"278_CR16","unstructured":"Rogers, H, Jr.: Theory of recursive functions and effective computability, McGraw-Hill, 1967"},{"key":"278_CR17","unstructured":"Simpson, S. G.: slides for a talk posted on http:\/\/www.math.psu.edu\/simpson\/talks\/umn0105, 2003"},{"key":"278_CR18","unstructured":"Simpson, S. G.: \u03a001 sets and models of WKL0 to appear in: Reverse Mathematics 2001. Lecture Notes in Logic, ASL"},{"key":"278_CR19","unstructured":"Simpson, S. G., Slaman, T. A.: Medvedev degrees of \u03a001 subsets of 2\u03c9. unpublished manuscript"},{"key":"278_CR20","doi-asserted-by":"crossref","unstructured":"Skvortsova, E. Z.: A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice, Sibirsk. Math. Zh. 29 (1), 171\u2013178 (1988) (In Russian.)","DOI":"10.1007\/BF00975025"},{"key":"278_CR21","doi-asserted-by":"crossref","unstructured":"Sorbi, A.: Some remarks on the algebraic structure of the Medvedev lattice. Journal of Symbolic Logic 55 (2), 831\u2013853 (1990)","DOI":"10.2307\/2274668"},{"key":"278_CR22","doi-asserted-by":"crossref","unstructured":"Sorbi, A.: Embedding Brouwer algebras in the Medvedev lattice. Notre Dame Journal of Formal Logic 32 (2), 266\u2013275 (1991)","DOI":"10.1305\/ndjfl\/1093635751"},{"key":"278_CR23","doi-asserted-by":"crossref","unstructured":"Sorbi, A.: Some quotient lattices of the Medvedev lattice. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik 37, 167\u2013182 (1991)","DOI":"10.1002\/malq.19910370905"},{"key":"278_CR24","doi-asserted-by":"crossref","unstructured":"Sorbi, A.: The Medvedev lattice of degrees of difficulty. In: S. B. Cooper, T. A. Slaman, and S.S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory, London Mathematical Society Lecture Notes 224, Cambridge University Press, 1996, pp. 289\u2013312","DOI":"10.1017\/CBO9780511629167.015"},{"key":"278_CR25","unstructured":"Sorbi, A.: personal communication, Siena, July 2004"},{"key":"278_CR26","unstructured":"Terwijn, S. A.: Complexity and Randomness. Rendiconti del Seminario Matematico di Torino 62 (1), 1\u201338 (2004)"},{"key":"278_CR27","doi-asserted-by":"crossref","unstructured":"Terwijn, S. A.: Constructive logic and the Medvedev lattice, Journal of Formal Logic (in press) Notre Dame","DOI":"10.1305\/ndjfl\/1143468312"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-005-0278-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-005-0278-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-005-0278-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:27:26Z","timestamp":1586471246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-005-0278-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,27]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["278"],"URL":"https:\/\/doi.org\/10.1007\/s00153-005-0278-y","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9,27]]}}}