{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:31:12Z","timestamp":1742949072296,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"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_7","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:48:17Z","timestamp":1630432097000},"page":"112-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Basing Sequent Systems on Exclusive-Or"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6831-3343","authenticated-orcid":false,"given":"Arnon","family":"Avron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"939","DOI":"10.2307\/2273828","volume":"52","author":"A Avron","year":"1987","unstructured":"Avron, A.: A constructive analysis of RM. J. Symb. Log. 52, 939\u2013951 (1987)","journal-title":"J. Symb. Log."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(91)90023-U","volume":"92","author":"A Avron","year":"1991","unstructured":"Avron, A.: Simple consequence relations. Inf. Comput. 92, 105\u2013139 (1991)","journal-title":"Inf. Comput."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in proof theory of propositional non-classical logics. In: Hodges, W., Hyland, M., Steinhorn, C., Truss, J. (eds.) Logic: Foundations to Applications, pp. 1\u201332. Oxford Science Publications (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Avron, A.: Implication, Equivalence, and Negation. Logical Investigations 27, 31\u201345 (2021)","DOI":"10.21146\/2074-1472-2021-27-1-31-45"},{"key":"7_CR5","unstructured":"Gentzen, G.: Investigations into logical deduction, 1934. In: Szabo, M.E. (ed.) German. An English Translation Appears in \u2018The Collected Works of Gerhard Gentzen\u2019. North-Holland (1969)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JE Girard","year":"1987","unstructured":"Girard, J.E.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR7","volume-title":"A Treatise on Many-Valued Logics, Studies in Logic and Computation","author":"S Gottwald","year":"2001","unstructured":"Gottwald, S.: A Treatise on Many-Valued Logics, Studies in Logic and Computation, vol. 9. Research Studies Press, Baldock (2001)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1305\/ndjfl\/1093887829","volume":"18","author":"GJ Massey","year":"1977","unstructured":"Massey, G.J.: Negation, material equivalence, and conditioned nonconjunction: completeness and duality. Notre Dame J. Formal Log. 18, 140\u2013144 (1977)","journal-title":"Notre Dame J. Formal Log."},{"key":"7_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-9409-5","volume-title":"Proof Theory for Fuzzy Logics","author":"G Metcalfe","year":"2009","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer, Heidelberg (2009)"},{"key":"7_CR10","first-page":"369","volume":"23","author":"EG Mihailescu","year":"1937","unstructured":"Mihailescu, E.G.: Recherches sur la negation el l\u2019\u00e9quivalence dans le calcul des proposition. Annales scientiftques de l\u2019Universit\u00e9 de Jas 23, 369\u2013408 (1937)","journal-title":"Annales scientiftques de l\u2019Universit\u00e9 de Jas"},{"key":"7_CR11","first-page":"97","volume":"98","author":"GE Mints","year":"1968","unstructured":"Mints, G.E.: Some calculi of modal logic. Proc. Steklov Inst. Math. 98, 97\u2013122 (1968)","journal-title":"Proc. Steklov Inst. Math."},{"key":"7_CR12","first-page":"900","volume":"48","author":"G Pottinger","year":"1983","unstructured":"Pottinger, G.: Uniform, cut-free formulations of T, S4 and S5 (abstract). J. Symb. Log. 48, 900 (1983)","journal-title":"J. Symb. Log."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Urquhart, A.: Many-valued logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. II, 2nd edn., pp. 249\u2013295. Kluwer (2001)","DOI":"10.1007\/978-94-017-0452-6_4"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T02:39:36Z","timestamp":1699411176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86059-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030860585","9783030860592"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86059-2_7","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)"}}]}}