{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:05:24Z","timestamp":1759017924746,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032060846","type":"print"},{"value":"9783032060853","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We define base-extension semantics (<jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\textsf{BeS}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>BeS<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>) using atomic systems based on sequent calculus rather than natural deduction. While traditional <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\textsf{BeS}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>BeS<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> aligns naturally with intuitionistic logic due to its constructive foundations, we show that sequent calculi with multiple conclusions yield a <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\textsf{BeS}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>BeS<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> framework more suited to classical semantics. The harmony in classical sequents leads to straightforward semantic clauses derived solely from right introduction rules. This framework enables a Sandqvist-style completeness proof that extracts a sequent calculus proof from any valid semantic consequence. Moreover, we show that the inclusion or omission of atomic cut rules meaningfully affects the semantics, yet completeness holds in both cases.<\/jats:p>","DOI":"10.1007\/978-3-032-06085-3_1","type":"book-chapter","created":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T10:45:10Z","timestamp":1758969910000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Sequent Calculus Perspective on\u00a0Base-Extension Semantics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3990-5996","authenticated-orcid":false,"given":"Victor","family":"Barroso-Nascimento","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4217-6948","authenticated-orcid":false,"given":"Ekaterina","family":"Piotrovskaya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7113-0801","authenticated-orcid":false,"given":"Elaine","family":"Pimentel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Barroso-Nascimento, V., Pereira, L.C., Pimentel, E.: An ecumenical view of proof-theoretic semantics. CoRR abs\/2306.03656 (2025). https:\/\/doi.org\/10.48550\/arXiv.2306.03656, accepted to Synthese","DOI":"10.48550\/arXiv.2306.03656"},{"key":"1_CR2","unstructured":"Barroso-Nascimento, V., Piotrovskaya, E., Pimentel, E.: A proof-theoretic approach to the semantics of classical linear logic (2025). https:\/\/arxiv.org\/abs\/2504.08349, to appear in the proceedings of MFPS 2025"},{"key":"1_CR3","unstructured":"Barroso-Nascimento, V., Piotrovskaya, E., Pimentel, E.: A sequent calculus perspective on base-extension semantics (technical report) (2025). https:\/\/arxiv.org\/abs\/2505.18589"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Buzoku, Y.: A proof-theoretic semantics for intuitionistic linear logic. CoRR abs\/2402.01982 (2024). https:\/\/doi.org\/10.48550\/arXiv.2402.01982, accepted to Studia Logica","DOI":"10.48550\/arXiv.2402.01982"},{"issue":"8","key":"1_CR5","doi-asserted-by":"publisher","first-page":"2539","DOI":"10.1007\/s11229-015-0865-3","volume":"193","author":"W de Campos Sanz","year":"2015","unstructured":"de Campos Sanz, W., Oliveira, H.: On dummett\u2019s verificationist justification procedure. Synthese 193(8), 2539\u20132559 (2015). https:\/\/doi.org\/10.1007\/s11229-015-0865-3","journal-title":"Synthese"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Cook, R.: Intuitionism reconsidered. In: The Oxford Handbook of Philosophy of Mathematics and Logic. Oxford University Press (2007). https:\/\/doi.org\/10.1093\/oxfordhb\/9780195325928.003.0011","DOI":"10.1093\/oxfordhb\/9780195325928.003.0011"},{"key":"1_CR7","volume-title":"Frege: Philosophy of Language","author":"M Dummett","year":"1973","unstructured":"Dummett, M.: Frege: Philosophy of Language. Duckworth, London (1973)"},{"key":"1_CR8","unstructured":"Dummett, M.: The Logical Basis of Metaphysics. Harvard University Press (1991)"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"260","DOI":"10.2178\/jsl.7801180","volume":"78","author":"F Ferreira","year":"2013","unstructured":"Ferreira, F., Ferreira, G.: Atomic polymorphism. J. Symb. Log. 78(1), 260\u2013274 (2013). https:\/\/doi.org\/10.2178\/jsl.7801180","journal-title":"J. Symb. Log."},{"key":"1_CR10","unstructured":"Gentzen, G.: Investigations into logical deduction. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen. North-Holland Publishing Company (1969)"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Gheorghiu, A.V., Buzoku, Y.: Proof-theoretic semantics for classical propositional logic with assertion and denial. CoRR abs\/2503.05364 (2025). https:\/\/doi.org\/10.48550\/arXiv.2503.05364","DOI":"10.48550\/arXiv.2503.05364"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Gheorghiu, A.V., Gu, T., Pym, D.J.: Proof-theoretic semantics for intuitionistic multiplicative linear logic. In: Ramanayake, R., Urban, J. (eds.) Automated Reasoning with Analytic Tableaux and Related Methods - 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, 18\u201321 September 2023, Proceedings. Lecture Notes in Computer Science, vol. 14278, pp. 367\u2013385. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43513-3_20","DOI":"10.1007\/978-3-031-43513-3_20"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Halln\u00e4s, L., Schroeder-Heister, P.: A proof-theoretic approach to logic programming. II. programs as definitions. J. Log. Comput. 1(5), 635\u2013660 (1991). https:\/\/doi.org\/10.1093\/logcom\/1.5.635","DOI":"10.1093\/logcom\/1.5.635"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1093\/jigpal\/jzt038","volume":"22","author":"D Makinson","year":"2014","unstructured":"Makinson, D.: On an inferential semantics for classical logic. Log. J. IGPL 22(1), 147\u2013154 (2014). https:\/\/doi.org\/10.1093\/jigpal\/jzt038","journal-title":"Log. J. IGPL"},{"issue":"5","key":"1_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2022.103091","volume":"173","author":"S Marin","year":"2022","unstructured":"Marin, S., Miller, D., Pimentel, E., Volpe, M.: From axioms to synthetic inference rules via focusing. Ann. Pure Appl. Log. 173(5), 103091 (2022). https:\/\/doi.org\/10.1016\/J.APAL.2022.103091","journal-title":"Ann. Pure Appl. Log."},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Martins, L.R., Martins, A.T.: Natural deduction and weak normalization for full linear logic. Logic J. IGPL 12(6), 601\u2013625 (2004). https:\/\/doi.org\/10.1093\/jigpal\/12.6.601","DOI":"10.1093\/jigpal\/12.6.601"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/504077.504080","volume":"3","author":"R McDowell","year":"2002","unstructured":"McDowell, R., Miller, D.: Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. Comput. Log. 3(1), 80\u2013136 (2002). https:\/\/doi.org\/10.1145\/504077.504080","journal-title":"ACM Trans. Comput. Log."},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1094622.1094628","volume":"6","author":"D Miller","year":"2005","unstructured":"Miller, D., Tiu, A.: A proof theory for generic judgments. ACM Trans. Comput. Log. 6(4), 749\u2013783 (2005). https:\/\/doi.org\/10.1145\/1094622.1094628","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10992-014-9322-x","volume":"44","author":"T Piecha","year":"2014","unstructured":"Piecha, T., de Campos Sanz, W., Schroeder-Heister, P.: Failure of completeness in proof-theoretic semantics. J. Philos. Log. 44(3), 321\u2013335 (2014). https:\/\/doi.org\/10.1007\/s10992-014-9322-x","journal-title":"J. Philos. Log."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Prawitz, D.: Ideas and results in proof theory. In: Fenstad, J. (ed.) Proceedings of the Second Scandinavian Logic Symposium. Studies in Logic and the Foundations of Mathematics, vol.\u00a063, pp. 235\u2013307. Elsevier (1971). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0049237X08708498","DOI":"10.1016\/S0049-237X(08)70849-8"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s11229-004-6295-2","volume":"148","author":"D Prawitz","year":"2006","unstructured":"Prawitz, D.: Meaning approached via proofs. Synthese 148, 507\u2013524 (2006). https:\/\/doi.org\/10.1007\/s11229-004-6295-2","journal-title":"Synthese"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Sandqvist, T.: Classical logic without bivalence. Analysis 69(2), 211\u2013218 (2009). https:\/\/doi.org\/10.1093\/analys\/anp003","DOI":"10.1093\/analys\/anp003"},{"issue":"5","key":"1_CR23","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1093\/jigpal\/jzv021","volume":"23","author":"T Sandqvist","year":"2015","unstructured":"Sandqvist, T.: Base-extension semantics for intuitionistic sentential logic. Logic J. IGPL 23(5), 719\u2013731 (2015). https:\/\/doi.org\/10.1093\/jigpal\/jzv021","journal-title":"Logic J. IGPL"},{"key":"1_CR24","first-page":"1142","volume":"56","author":"P Schroeder-Heister","year":"1991","unstructured":"Schroeder-Heister, P.: Uniform proof-theoretic semantics for logical constants (abstract). J. Symb. Log. 56, 1142 (1991)","journal-title":"J. Symb. Log."},{"key":"1_CR25","unstructured":"Schroeder-Heister, P.: Proof-theoretic semantics. In: Zalta, E.N., Nodelman, U. (eds.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Winter 2022 edn. (2022). https:\/\/plato.stanford.edu\/archives\/win2022\/entries\/proof-theoretic-semantics\/"}],"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-032-06085-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T10:45:12Z","timestamp":1758969912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06085-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,25]]},"ISBN":["9783032060846","9783032060853"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06085-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,25]]},"assertion":[{"value":"25 September 2025","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":"Reykjavik","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iceland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icetcs.github.io\/frocos-itp-tableaux25\/tableaux\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}