乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:42:03Z","timestamp":1743021723390,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030860585"},{"type":"electronic","value":"9783030860592"}],"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-86059-2_23","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:48:17Z","timestamp":1630432097000},"page":"391-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Terminating Calculi and Countermodels for Constructive Modal Logics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7153-0506","authenticated-orcid":false,"given":"Tiziano","family":"Dalmonte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0926-7484","authenticated-orcid":false,"given":"Charles","family":"Grellois","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6254-3754","authenticated-orcid":false,"given":"Nicola","family":"Olivetti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"issue":"3","key":"23_CR1","first-page":"1","volume":"11","author":"R Arisaka","year":"2015","unstructured":"Arisaka, R., Das, A., Stra\u00dfburger, L.: On nested sequents for constructive modal logics. Log. Methods Comput. Sci. 11(3), 1\u201333 (2015)","journal-title":"Log. Methods Comput. Sci."},{"key":"23_CR2","unstructured":"Bellin, G., De Paiva, V., Ritter, E.: Extended Curry-Howard correspondence for a basic constructive modal logic. In: Proceedings of Methods for Modalities, vol. 2 (2001)"},{"issue":"5","key":"23_CR3","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10992-019-09539-3","volume":"49","author":"T Dalmonte","year":"2020","unstructured":"Dalmonte, T., Grellois, C., Olivetti, N.: Intuitionistic non-normal modal logics: a general framework. J. Philos. Log. 49(5), 833\u2013882 (2020)","journal-title":"J. Philos. Log."},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"795","DOI":"10.2307\/2275431","volume":"57","author":"R Dyckhoff","year":"1992","unstructured":"Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symb. Log. 57(3), 795\u2013807 (1992)","journal-title":"J. Symb. Log."},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.2307\/2695061","volume":"65","author":"R Dyckhoff","year":"2000","unstructured":"Dyckhoff, R., Negri, S.: Admissibility of structural rules for contraction-free systems of intuitionistic logic. J. Symb. Log. 65(4), 1499\u20131518 (2000)","journal-title":"J. Symb. Log."},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10817-012-9252-7","volume":"51","author":"M Ferrari","year":"2013","unstructured":"Ferrari, M., Fiorentini, C., Fiorino, G.: Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models. J. Autom. Reason. 51(2), 129\u2013149 (2013)","journal-title":"J. Autom. Reason."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Fischer Servi, G.: Semantics for a class of intuitionistic modal calculi. In: Dalla Chiara, M.L. (ed.) Italian Studies in the Philosophy of Science. BSPS, vol. 47, pp. 59\u201372. Springer, Dordrecht (1980). https:\/\/doi.org\/10.1007\/978-94-009-8937-5_5","DOI":"10.1007\/978-94-009-8937-5_5"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/2269228","volume":"14","author":"FB Fitch","year":"1950","unstructured":"Fitch, F.B.: Intuitionistic modal logic with quantifiers. J. Symb. Log. 14(4), 113\u2013118 (1950)","journal-title":"J. Symb. Log."},{"key":"23_CR9","unstructured":"van der Giessen, I., Iemhoff, R.: Proof theory for intuitionistic strong L\u00f6b logic. arXiv preprint arXiv:2011.10383 (2020)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-51054-1_25","volume-title":"Automated Reasoning","author":"M Girlando","year":"2020","unstructured":"Girlando, M., Stra\u00dfburger, L.: MOIN: a nested sequent theorem prover for intuitionistic modal logics (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 398\u2013407. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_25"},{"issue":"31\u201335","key":"23_CR11","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/malq.19810273104","volume":"27","author":"RI Goldblatt","year":"1981","unstructured":"Goldblatt, R.I.: Grothendieck topology as geometric modality. Math. Log. Q. 27(31\u201335), 495\u2013529 (1981)","journal-title":"Math. Log. Q."},{"key":"23_CR12","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: Cut-elimination and proof search for biintuitionistic tense logic. In: Shehtman, V., Beklemishev, L., Goranko, V. (eds.) Advances in Modal Logic 8, pp. 156\u2013177. College Publications (2010)"},{"issue":"7","key":"23_CR13","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1093\/logcom\/exy026","volume":"28","author":"R Iemhoff","year":"2018","unstructured":"Iemhoff, R.: Terminating sequent calculi for two intuitionistic modal logics. J. Log. Comput. 28(7), 1701\u20131712 (2018)","journal-title":"J. Log. Comput."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Iemhoff, R.: Uniform interpolation and the existence of sequent calculi. Ann. Pure Appl. Log. 170(11), 102711 (2019)","DOI":"10.1016\/j.apal.2019.05.008"},{"key":"23_CR15","first-page":"87","volume":"47","author":"K Kojima","year":"2012","unstructured":"Kojima, K.: Relational and neighborhood semantics for intuitionistic modal logic. Rep. Math. Log. 47, 87\u2013113 (2012)","journal-title":"Rep. Math. Log."},{"key":"23_CR16","unstructured":"Mendler, M., De Paiva, V.: Constructive CK for contexts. Context Representation and Reasoning (CRR-2005) 13 (2005)"},{"issue":"12","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.ic.2011.10.003","volume":"209","author":"M Mendler","year":"2011","unstructured":"Mendler, M., Scheele, S.: Cut-free Gentzen calculus for multimodal CK. Inf. Comput. 209(12), 1465\u20131490 (2011)","journal-title":"Inf. Comput."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Pinto, L., Dyckhoff, R.: Loop-free construction of counter-models for intuitionistic propositional logic. In: Symposia Gaussiana, Conference A, pp. 225\u2013232 (1995)","DOI":"10.1515\/9783110886726.225"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Plotkin, G., Stirling, C.: A framework for intuitionistic modal logics. In: Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge (TARK), pp. 399\u2013406 (1986)","DOI":"10.1016\/B978-0-934613-04-0.50032-6"},{"key":"23_CR20","unstructured":"Prawitz, D.: Natural Deduction: A Proof-Theoretical Study. Almqvist & Wiksell (1965)"},{"key":"23_CR21","unstructured":"Simpson, A.K.: The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, School of Informatics, University of Edinburgh (1994)"},{"issue":"5","key":"23_CR22","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1093\/logcom\/exv042","volume":"28","author":"C Stewart","year":"2018","unstructured":"Stewart, C., de Paiva, V., Alechina, N.: Intuitionistic modal logic: a 15-year retrospective. J. Log. Comput. 28(5), 873\u2013882 (2018)","journal-title":"J. Log. Comput."},{"issue":"3","key":"23_CR23","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0168-0072(90)90059-B","volume":"50","author":"D Wijesekera","year":"1990","unstructured":"Wijesekera, D.: Constructive modal logics I. Ann. Pure Appl. Log. 50(3), 271\u2013301 (1990)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1\u20133","key":"23_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2004.12.001","volume":"135","author":"D Wijesekera","year":"2005","unstructured":"Wijesekera, D., Nerode, A.: Tableaux for constructive concurrent dynamic logic. Ann. Pure Appl. Log. 135(1\u20133), 1\u201372 (2005)","journal-title":"Ann. Pure Appl. Log."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86059-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:56:42Z","timestamp":1630432602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86059-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030860585","9783030860592"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86059-2_23","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":"30 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Birmingham","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2021.org\/","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":"46","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":"50% - 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":"4","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":"5","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)"}}]}}