{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:50Z","timestamp":1742913590926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"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_15","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T23:02:56Z","timestamp":1562194976000},"page":"168-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Cohesive Powers of Linear Orders"],"prefix":"10.1007","author":[{"given":"Rumen","family":"Dimitrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Harizanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrey","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Shafer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Soskova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vatev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00153-008-0078-2","volume":"47","author":"RD Dimitrov","year":"2008","unstructured":"Dimitrov, R.D.: A class of $${\\Sigma } _{3}^{0}$$ modular lattices embeddable as principal filters in $$\\cal{L}^{\\ast }(V_{\\infty })$$. Arch. Math. Logic 47, 111\u2013132 (2008)","journal-title":"Arch. Math. Logic"},{"key":"15_CR2","unstructured":"Dimitrov, R.D.: Cohesive powers of computable structures, vol. 99, pp. 193\u2013201. Annuaire De L\u2019Universite De Sofia \u201cSt. Kliment Ohridski\u201d, Fac. Math. and Inf. (2009)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Dimitrov, R.D., Harizanov, V.: Orbits of maximal vector spaces. Algebra Logic 54, 680\u2013732 (2015) (Russian) 440\u2013477 (2016) (English translation)","DOI":"10.1007\/s10469-016-9366-9"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-08019-2_15","volume-title":"Language, Life, Limits","author":"R Dimitrov","year":"2014","unstructured":"Dimitrov, R., Harizanov, V., Miller, R., Mourad, K.J.: Isomorphisms of non-standard fields and ash\u2019s conjecture. In: Beckmann, A., Csuhaj-Varj\u00fa, E., Meer, K. (eds.) CiE 2014. LNCS, vol. 8493, pp. 143\u2013152. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08019-2_15"},{"key":"15_CR5","unstructured":"Dimitrov, R., Harizanov, V., Morozov, A., Shafer, P., Soskova, A., and Vatev, S.: Cohesive powers, linear orders and Fra\u00efss\u00e9 limits, Unpublished manuscript"},{"key":"15_CR6","first-page":"173","volume":"6","author":"S Feferman","year":"1959","unstructured":"Feferman, S., Scott, D.S., Tennenbaum, S.: Models of arithmetic through function rings. Not. Amer. Math. Soc. 6, 173 (1959). Abstract #556-31","journal-title":"Not. Amer. Math. Soc."},{"key":"15_CR7","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0064082","volume-title":"Forcing, Arithmetic, Division Rings","author":"J Hirschfeld","year":"1975","unstructured":"Hirschfeld, J., Wheeler, W.H.: Forcing, Arithmetic, Division Rings. LNM, vol. 454. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/BFb0064082"},{"key":"15_CR8","first-page":"429","volume":"148","author":"M Lerman","year":"1970","unstructured":"Lerman, M.: Recursive functions modulo co-$$r$$-maximal sets. Trans. Am. Math. Soc. 148, 429\u2013444 (1970)","journal-title":"Trans. Am. Math. Soc."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0168-0072(90)90064-9","volume":"49","author":"T McLaughlin","year":"1990","unstructured":"McLaughlin, T.: Sub-arithmetical ultrapowers: a survey. Ann. Pure Appl. Logic 49, 143\u2013191 (1990)","journal-title":"Ann. Pure Appl. Logic"},{"key":"15_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Springer, Heidelberg (1987)"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:20:33Z","timestamp":1709810433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22996-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030229955","9783030229962"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22996-2_15","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)"}}]}}