{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:15:19Z","timestamp":1742937319161,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030229955"},{"type":"electronic","value":"9783030229962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22996-2_8","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T23:02:56Z","timestamp":1562194976000},"page":"84-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective Embeddings for Pairs of Structures"],"prefix":"10.1007","author":[{"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[]},{"given":"Hristo","family":"Ganchev","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Vatev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0168-0072(90)90004-L","volume":"46","author":"CJ Ash","year":"1990","unstructured":"Ash, C.J., Knight, J.F.: Pairs of recursive structures. Ann. Pure Appl. Logic 46(3), 211\u2013234 (1990). https:\/\/doi.org\/10.1016\/0168-0072(90)90004-L","journal-title":"Ann. Pure Appl. Logic"},{"key":"8_CR2","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","author":"CJ Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 44. Elsevier Science B.V., Amsterdam (2000)"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1017\/S096012951600030X","volume":"28","author":"N Bazhenov","year":"2018","unstructured":"Bazhenov, N.: Autostability spectra for decidable structures. Math. Struct. Comput. Sci. 28(3), 392\u2013411 (2018). https:\/\/doi.org\/10.1017\/S096012951600030X","journal-title":"Math. Struct. Comput. Sci."},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1023\/B:ALLO.0000048827.30718.2c","volume":"43","author":"W Calvert","year":"2004","unstructured":"Calvert, W., Cummins, D., Knight, J.F., Miller, S.: Comparing classes of finite structures. Algebra Logic 43(6), 374\u2013392 (2004). https:\/\/doi.org\/10.1023\/B:ALLO.0000048827.30718.2c","journal-title":"Algebra Logic"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.2178\/jsl\/1191333854","volume":"72","author":"J Chisholm","year":"2007","unstructured":"Chisholm, J., Knight, J.F., Miller, S.: Computable embeddings and strongly minimal theories. J. Symb. Log. 72(3), 1031\u20131040 (2007). https:\/\/doi.org\/10.2178\/jsl\/1191333854","journal-title":"J. Symb. Log."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Ershov, Y.L., Puzarenko, V.G., Stukachev, A.I.: $$HF$$-Computability. In: Cooper, S.B., Sorbi, A. (eds.) Computability in Context, pp. 169\u2013242. Imperial College Press, London (2011). https:\/\/doi.org\/10.1142\/9781848162778_0006","DOI":"10.1142\/9781848162778_0006"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2178\/jsl\/1309952523","volume":"76","author":"E Fokina","year":"2011","unstructured":"Fokina, E., Knight, J.F., Melnikov, A., Quinn, S.M., Safranski, C.: Classes of Ulm type and coding rank-homogeneous trees in other structures. J. Symb. Log. 76(3), 846\u2013869 (2011). https:\/\/doi.org\/10.2178\/jsl\/1309952523","journal-title":"J. Symb. Log."},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"894","DOI":"10.2307\/2274750","volume":"54","author":"H Friedman","year":"1989","unstructured":"Friedman, H., Stanley, L.: A Borel reducibility theory for classes of countable structures. J. Symb. Log. 54(3), 894\u2013914 (1989). https:\/\/doi.org\/10.2307\/2274750","journal-title":"J. Symb. Log."},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.apal.2005.02.001","volume":"136","author":"S Goncharov","year":"2005","unstructured":"Goncharov, S., Harizanov, V., Knight, J., McCoy, C., Miller, R., Solomon, R.: Enumerations in computable structure theory. Ann. Pure Appl. Logic 136(3), 219\u2013246 (2005). https:\/\/doi.org\/10.1016\/j.apal.2005.02.001","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/jsl.2016.12","volume":"82","author":"M Harrison-Trainor","year":"2017","unstructured":"Harrison-Trainor, M., Melnikov, A., Miller, R., Mont\u00e1lban, A.: Computable functors and effective interpretability. J. Symb. Log. 82(1), 77\u201397 (2017). https:\/\/doi.org\/10.1017\/jsl.2016.12","journal-title":"J. Symb. Log."},{"issue":"1\u20133","key":"8_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0168-0072(01)00087-2","volume":"115","author":"DR Hirschfeldt","year":"2002","unstructured":"Hirschfeldt, D.R., Khoussainov, B., Shore, R.A., Slinko, A.M.: Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Logic 115(1\u20133), 71\u2013113 (2002). https:\/\/doi.org\/10.1016\/S0168-0072(01)00087-2","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1134\/S1995080218010146","volume":"39","author":"IS Kalimullin","year":"2018","unstructured":"Kalimullin, I.S.: Computable embeddings of classes of structures under enumeration and Turing operators. Lobachevskii J. Math. 39(1), 84\u201388 (2018). https:\/\/doi.org\/10.1134\/S1995080218010146","journal-title":"Lobachevskii J. Math."},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"901","DOI":"10.2178\/jsl\/1191333847","volume":"72","author":"JF Knight","year":"2007","unstructured":"Knight, J.F., Miller, S., Vanden Boom, M.: Turing computable embeddings. J. Symb. Log. 72(3), 901\u2013918 (2007). https:\/\/doi.org\/10.2178\/jsl\/1191333847","journal-title":"J. Symb. Log."},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Miller, R.: Isomorphism and classification for countable structures. Computability (2018). https:\/\/doi.org\/10.3233\/COM-180095, published online","DOI":"10.3233\/COM-180095"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1017\/jsl.2017.50","volume":"83","author":"R Miller","year":"2018","unstructured":"Miller, R., Poonen, B., Schoutens, H., Shlapentokh, A.: A computable functor from graphs to fields. J. Symb. Log. 83(1), 326\u2013348 (2018). https:\/\/doi.org\/10.1017\/jsl.2017.50","journal-title":"J. Symb. Log."},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s11202-009-0038-z","volume":"50","author":"VG Puzarenko","year":"2009","unstructured":"Puzarenko, V.G.: A certain reducibility on admissible sets. Sib. Math. J. 50(2), 330\u2013340 (2009). https:\/\/doi.org\/10.1007\/s11202-009-0038-z","journal-title":"Sib. Math. J."},{"key":"8_CR17","series-title":"Pure and Applied Mathematics","volume-title":"Linear Orderings","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Pure and Applied Mathematics, vol. 98. Academic Press, New York (1982)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"690","DOI":"10.17377\/semi.2017.14.059","volume":"14","author":"D Rossegger","year":"2017","unstructured":"Rossegger, D.: On functors enumerating structures. Sib. Elektron. Mat. Izv. 14, 690\u2013702 (2017). https:\/\/doi.org\/10.17377\/semi.2017.14.059","journal-title":"Sib. Elektron. Mat. Izv."}],"container-title":["Lecture Notes in Computer Science","Computing with Foresight and Industry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22996-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:19:41Z","timestamp":1709810381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22996-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030229955","9783030229962"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22996-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 June 2019","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":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/community.dur.ac.uk\/cie.2019\/","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":"35","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":"20","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":"57% - 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":"4","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)"}},{"value":"Also included are 7 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}