{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:40:10Z","timestamp":1742989210654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030800482"},{"type":"electronic","value":"9783030800499"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80049-9_34","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T18:06:14Z","timestamp":1625162774000},"page":"363-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subrecursive Equivalence Relations and\u00a0(non-)Closure Under Lattice Operations"],"prefix":"10.1007","author":[{"given":"Jean-Yves","family":"Moyen","sequence":"first","affiliation":[]},{"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-50062-1_25","volume-title":"Computability and Complexity","author":"U Andrews","year":"2017","unstructured":"Andrews, U., Badaev, S., Sorbi, A.: A survey on universal computably enumerable equivalence relations. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 418\u2013451. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50062-1_25"},{"issue":"4","key":"34_CR2","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1017\/jsl.2016.26","volume":"81","author":"U Andrews","year":"2016","unstructured":"Andrews, U., Sorbi, A.: The complexity of index sets of classes of computably enumerable equivalence relations. J. Symbolic Logic 81(4), 1375\u20131395 (2016)","journal-title":"J. Symbolic Logic"},{"issue":"3\u20134","key":"34_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.3233\/COM-180098","volume":"8","author":"U Andrews","year":"2019","unstructured":"Andrews, U., Sorbi, A.: Joins and meets in the structure of ceers. Computability 8(3\u20134), 193\u2013241 (2019)","journal-title":"Computability"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Asperti, A.: The intensional content of rice\u2019s theorem. In: Proceedings of the 35th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL 2008) (2008)","DOI":"10.1145\/1328438.1328455"},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00012-018-0514-z","volume":"79","author":"JE Avery","year":"2018","unstructured":"Avery, J.E., Moyen, J.Y., R\u016f\u017ei\u010dka, P., Simonsen, J.G.: Chains, antichains, and complements in infinite partition lattices. Algebra Univers. 79(2), 37 (2018)","journal-title":"Algebra Univers."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Birkhoff, G.: Lattice Theory, Colloquium Publications, vol. 25. American Mathematical Society (1940)","DOI":"10.1090\/coll\/025"},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. J. ACM 14(2), 322\u2013336 (1967)","journal-title":"J. ACM"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra, Graduate Texts in Mathematics, vol. 78. Springer, New York (1981)","DOI":"10.1007\/978-1-4613-8130-3"},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2140\/pjm.1986.122.319","volume":"122","author":"JS Carroll","year":"1986","unstructured":"Carroll, J.S.: Some undecidability results for lattices in recursion theory. Pacific J. Math. 122(2), 319\u2013331 (1986)","journal-title":"Pacific J. Math."},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1010521410739","volume":"67","author":"S Gao","year":"2001","unstructured":"Gao, S., Gerdes, P.: Computably enumerable equivalence relations. Studia Logica: Int. J. Symbolic Logic 67(1), 27\u201359 (2001)","journal-title":"Studia Logica: Int. J. Symbolic Logic"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2015.11.042","volume":"612","author":"A Gavryushkin","year":"2016","unstructured":"Gavryushkin, A., Khoussainov, B., Stephan, F.: Reducibilities among equivalence relations induced by recursively enumerable structures. Theoretical Computer Science 612, 137\u2013152 (2016)","journal-title":"Theoretical Computer Science"},{"key":"34_CR12","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory. Birkh\u00e4user, second edn. (2003)"},{"issue":"3","key":"34_CR13","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1017\/jsl.2013.33","volume":"79","author":"E Ianovski","year":"2014","unstructured":"Ianovski, E., Miller, R., Ng, K.M., Nies, A.: Complexity of equivalence relations and preorders from computability theory. J. Symbolic Logic 79(3), 859\u2013881 (2014)","journal-title":"J. Symbolic Logic"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Jones, N.D.: Computability and Complexity, from a Programming Perspective. MIT press (1997)","DOI":"10.7551\/mitpress\/2003.001.0001"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(80)90017-1","volume":"11","author":"D Kozen","year":"1980","unstructured":"Kozen, D.: Indexings of subrecursive classes. Theor. Comput. Sci. 11, 277\u2013301 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"34_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1093\/logcom\/14.3.373","volume":"14","author":"S Lusin","year":"2004","unstructured":"Lusin, S., Salibra, A.: The lattice of lambda theories. J. Log. Comput. 14(3), 373\u2013394 (2004)","journal-title":"J. Log. Comput."},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Moyen, J., Simonsen, J.G.: Computability in the lattice of equivalence relations. In: Proceedings of DICE-FOPARA@ETAPS 2017, pp. 38\u201346 (2017)","DOI":"10.4204\/EPTCS.248.8"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Moyen, J., Simonsen, J.G.: More intensional versions of Rice\u2019s theorem. In: Proceedings of the 15th Conference on Computability in Europe (CiE 2019), pp. 217\u2013229 (2019)","DOI":"10.1007\/978-3-030-22996-2_19"},{"issue":"3","key":"34_CR19","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1215\/S0012-7094-42-00942-6","volume":"9","author":"\u00d8 Ore","year":"1942","unstructured":"Ore, \u00d8.: Theory of equivalence relations. Duke Math. J. 9(3), 573\u2013627 (1942)","journal-title":"Duke Math. J."},{"key":"34_CR20","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"issue":"3","key":"34_CR21","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0022-0000(92)90027-G","volume":"45","author":"KW Regan","year":"1992","unstructured":"Regan, K.W.: Minimum-complexity pairing functions. J. Comput. Syst. Sci. 45(3), 285\u2013295 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Rice, H.G.: Classes of Recursively Enumerable Sets and Their Decision Problems. Trans. Am. Math. Soc. 74, 358\u2013366 (1953)","DOI":"10.1090\/S0002-9947-1953-0053041-6"},{"key":"34_CR23","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1967). (reprint, MIT press 1987)"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Stern, M.: Semimodular Lattices. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511665578"},{"key":"34_CR25","unstructured":"Visser, A.: Numerations, $$\\lambda $$-calculus and arithmetic. In: To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pp. 259\u2013284. Academic Press (1980)"}],"container-title":["Lecture Notes in Computer Science","Connecting with Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80049-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T17:06:33Z","timestamp":1638810393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80049-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030800482","9783030800499"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80049-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cie2021.ugent.be\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}