{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:20Z","timestamp":1742913560484,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"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-662-59533-6_34","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:02:35Z","timestamp":1561230155000},"page":"569-583","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs"],"prefix":"10.1007","author":[{"given":"Yury","family":"Savateev","sequence":"first","affiliation":[]},{"given":"Daniyar","family":"Shamkanov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-39185-1_9","volume-title":"Types for Proofs and Programs","author":"P Gianantonio Di","year":"2003","unstructured":"Di Gianantonio, P., Miculan, M.: A unifying approach to recursive and co-recursive definitions. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 148\u2013161. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-39185-1_9"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-94-017-1754-0_6","volume-title":"Handbook of Tableau Methods","author":"R Gor\u00e9","year":"1999","unstructured":"Gor\u00e9, R.: Tableau methods for modal and temporal logics. In: D\u2019Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 297\u2013396. Springer, Dordrecht (1999). \nhttps:\/\/doi.org\/10.1007\/978-94-017-1754-0_6"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11225-012-9432-9","volume":"102","author":"R Gor\u00e9","year":"2014","unstructured":"Gor\u00e9, R., Ramanayake, R.: Cut-elimination for weak Grzegorczyk logic Go. Studia Logica 102(1), 1\u201327 (2014)","journal-title":"Studia Logica"},{"key":"34_CR4","unstructured":"Iemhoff, R.: Reasoning in circles. In: Liber Amicorum Alberti. A tribute to Albert Visser. Tributes, vol. 30, pp. 165\u2013176 (2016)"},{"key":"34_CR5","first-page":"195","volume":"36","author":"T Litak","year":"2007","unstructured":"Litak, T.: The non-reflexive counterpart of Grz. Bull. Sect. Logic 36, 195\u2013208 (2007)","journal-title":"Bull. Sect. Logic"},{"issue":"3","key":"34_CR6","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1090\/S0002-9939-1993-1132421-2","volume":"118","author":"C Petalas","year":"1993","unstructured":"Petalas, C., Vidalis, T.: A fixed point theorem in non-Archimedean vector spaces. Proc. Am. Math. Soc. 118(3), 819\u2013821 (1993)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1\u20132","key":"34_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BF03323163","volume":"18","author":"S Prie\u00df-Crampe","year":"1990","unstructured":"Prie\u00df-Crampe, S.: Der Banachsche Fixpunktsatz f\u00fcr ultrametrische R\u00e4ume. Results Math. 18(1\u20132), 178\u2013186 (1990)","journal-title":"Results Math."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-662-55386-2_23","volume-title":"Logic, Language, Information, and Computation","author":"Y Savateev","year":"2017","unstructured":"Savateev, Y., Shamkanov, D.: Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 321\u2013335. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-55386-2_23"},{"key":"34_CR9","unstructured":"Savateev, Y., Shamkanov, D.: Non-Well-Founded Proofs for the Grzegorczyk Modal Logic. The Review of Symbolic Logic (to submitted)"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1134\/S0001434614090326","volume":"96","author":"DS Shamkanov","year":"2014","unstructured":"Shamkanov, D.S.: Circular proofs for the G\u00f6del-L\u00f6b provability logic. Math. Notes 96(3), 575\u2013585 (2014)","journal-title":"Math. Notes"},{"issue":"33","key":"34_CR11","first-page":"353","volume":"II","author":"E Sch\u00f6rner","year":"2003","unstructured":"Sch\u00f6rner, E.: Ultrametric fixed point theorems and applications. Valuat. Theory Appl. II(33), 353\u2013359 (2003)","journal-title":"Valuat. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T18:02:21Z","timestamp":1575655341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_34","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":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"60","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":"41","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":"6","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":"68% - 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":"2,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":"8","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)"}}]}}