{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:45:10Z","timestamp":1743147910933,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930998"},{"type":"electronic","value":"9783030931001"}],"license":[{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93100-1_5","type":"book-chapter","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T23:02:26Z","timestamp":1639609346000},"page":"52-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hyperarithmetical Worm Battles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8604-4183","authenticated-orcid":false,"given":"David","family":"Fern\u00e1ndez-Duque","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2831-0575","authenticated-orcid":false,"given":"Konstnatinos","family":"Papafilippou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9590-5045","authenticated-orcid":false,"given":"Joost J.","family":"Joosten","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,16]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0168-0072(96)00045-0","volume":"85","author":"LD Beklemishev","year":"1997","unstructured":"Beklemishev, L.D.: Induction rules, reflection principles, and provably recursive functions. Ann. Pure Appl. Log. 85, 193\u2013242 (1997)","journal-title":"Ann. Pure Appl. Log."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.apal.2003.11.030","volume":"128","author":"LD Beklemishev","year":"2004","unstructured":"Beklemishev, L.D.: Provability algebras and proof-theoretic ordinals, I. Ann. Pure Appl. Log. 128, 103\u2013124 (2004)","journal-title":"Ann. Pure Appl. Log."},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.4213\/rm1401","volume":"60","author":"LD Beklemishev","year":"2005","unstructured":"Beklemishev, L.D.: Reflection principles and provability algebras in formal arithmetic. Uspekhi Matematicheskikh Nauk 60(2), 3\u201378 (2005). (in Russian). English translation. In: Russian Mathematical Surveys 60(2), 197\u2013268 (2005)","journal-title":"Uspekhi Matematicheskikh Nauk"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s11225-013-9490-7","volume":"102","author":"LD Beklemishev","year":"2014","unstructured":"Beklemishev, L.D., Fern\u00e1ndez-Duque, D., Joosten, J.J.: On provability logics with linearly ordered modalities. Stud. Logica. 102, 541\u2013566 (2014)","journal-title":"Stud. Logica."},{"key":"5_CR5","unstructured":"Beklemishev, L.D., Pakhomov, F.N.: Reflection algebras and conservation results for theories of iterated truth. arXiv arXiv:1908.10302 [math.LO] (2019)"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1017\/jsl.2017.30","volume":"82","author":"A Cord\u00f3n Franco","year":"2017","unstructured":"Cord\u00f3n Franco, A., Fern\u00e1ndez-Duque, D., Joosten, J.J., Lara Mart\u00edn, F.: Predicativity through transfinite reflection. J. Symb. Log. 82(3), 787\u2013808 (2017)","journal-title":"J. Symb. Log."},{"issue":"5\u20136","key":"5_CR7","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s00153-018-0657-9","volume":"58","author":"A Enayat","year":"2019","unstructured":"Enayat, A., Pakhomov, F.: Truth, disjunction, and induction. Arch. Math. Logic 58(5\u20136), 753\u2013766 (2019)","journal-title":"Arch. Math. Logic"},{"issue":"3\u20134","key":"5_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s00153-014-0371-1","volume":"53","author":"D Fern\u00e1ndez-Duque","year":"2014","unstructured":"Fern\u00e1ndez-Duque, D.: The polytopologies of transfinite provability logic. Arch. Math. Logic 53(3\u20134), 385\u2013431 (2014)","journal-title":"Arch. Math. Logic"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2178\/jsl.7802110","volume":"78","author":"D Fern\u00e1ndez-Duque","year":"2013","unstructured":"Fern\u00e1ndez-Duque, D., Joosten, J.J.: Models of transfinite provability logics. J. Symb. Log. 78(2), 543\u2013561 (2013)","journal-title":"J. Symb. Log."},{"issue":"6","key":"5_CR10","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1093\/jigpal\/jzu018","volume":"22","author":"D Fern\u00e1ndez-Duque","year":"2014","unstructured":"Fern\u00e1ndez-Duque, D., Joosten, J.J.: Well-orders in the transfinite Japaridze algebra. Logic J. IGPL 22(6), 933\u2013963 (2014)","journal-title":"Logic J. IGPL"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.apal.2017.12.006","volume":"169","author":"D Fern\u00e1ndez-Duque","year":"2018","unstructured":"Fern\u00e1ndez-Duque, D., Joosten, J.J.: The omega-rule interpretation of transfinite provability logic. Ann. Pure Appl. Logic 169(4), 333\u2013371 (2018)","journal-title":"Ann. Pure Appl. Logic"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Halbach, V.: Axiomatic Theories of Truth. University of Oxford (2014)","DOI":"10.1017\/CBO9781139696586"},{"key":"5_CR13","unstructured":"Japaridze, G.: The polymodal provability logic. In: Intensional Logics and Logical Structure of Theories: Material from the 4th Soviet-Finnish Symposium on Logic. Metsniereba, Telaviv (1988). (in Russian)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s11225-016-9674-z","volume":"104","author":"JJ Joosten","year":"2016","unstructured":"Joosten, J.J.: Turing-Taylor expansions of arithmetic theories. Stud. Logica. 104, 1225\u20131243 (2016)","journal-title":"Stud. Logica."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Joosten, J.J.: M\u00fcnchhausen provability. J. Symb. Log., 1\u201330 (2021). https:\/\/doi.org\/10.1017\/jsl.2021.44","DOI":"10.1017\/jsl.2021.44"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"182","DOI":"10.2307\/2273332","volume":"48","author":"D Leivant","year":"1983","unstructured":"Leivant, D.: The optimality of induction as an axiomatization of arithmetic. J. Symb. Log. 48, 182\u2013184 (1983)","journal-title":"J. Symb. Log."},{"key":"5_CR17","unstructured":"Papafillipou, K.: Independent combinatoric worm principles for first order arithmetic and beyond. Master\u2019s thesis, Master of Pure and Applied Logic, University of Barcelona (2020). http:\/\/diposit.ub.edu\/dspace\/handle\/2445\/170755"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Rathjen, M.: The art of ordinal analysis. In: Proceedings of the International Congress of Mathematicians, vol. 2, pp. 45\u201369. European Mathematical Society (2006)","DOI":"10.4171\/022-2\/3"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","volume":"45","author":"A Turing","year":"1939","unstructured":"Turing, A.: Systems of logics based on ordinals. Proc. Lond. Math. Soc. 45, 161\u2013228 (1939)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93100-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T17:15:17Z","timestamp":1674062117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93100-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,16]]},"ISBN":["9783030930998","9783030931001"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93100-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021,12,16]]},"assertion":[{"value":"16 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/","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":"23","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":"66% - 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.1","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":"3.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)"}}]}}