{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T15:39:02Z","timestamp":1780328342572,"version":"3.54.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["(grant 280-10)"],"award-info":[{"award-number":["(grant 280-10)"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p>We identify a large family of fully structural propositional sequent systems, which we call<jats:italic>basic systems<\/jats:italic>. We present a general uniform method for providing (potentially, nondeterministic) strongly sound and complete Kripke-style semantics, which is applicable for every system of this family. In addition, this method can also be applied when: (i) some formulas are not allowed to appear in derivations, (ii) some formulas are not allowed to serve as cut formulas, and (iii) some instances of the identity axiom are not allowed to be used. This naturally leads to new semantic characterizations of analyticity (global subformula property), cut admissibility and axiom expansion in basic systems. We provide a large variety of examples showing that many soundness and completeness theorems for different sequent systems, as well as analyticity, cut admissibility, and axiom expansion results, easily follow using the general method of this article.<\/jats:p>","DOI":"10.1145\/2528930","type":"journal-article","created":{"date-parts":[[2013,12,4]],"date-time":"2013-12-04T14:04:47Z","timestamp":1386165887000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["A unified semantic framework for fully structural propositional sequent systems"],"prefix":"10.1145","volume":"14","author":[{"given":"Ori","family":"Lahav","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnon","family":"Avron","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,11,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2274147"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00881838"},{"key":"e_1_2_1_3_1","volume-title":"Studies in Logic Series","volume":"9","author":"Avron A.","year":"2007"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-6(4:12)2010"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 20th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'11)","author":"Avron A."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exi001"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0479-4_4"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Beklemishev L. and Gurevich Y. 2012. Propositional primal logic with disjunction. http:\/\/www.mi.ras.ru\/&sim;bekl\/Papers\/primlog.pdf. Beklemishev L. and Gurevich Y. 2012. Propositional primal logic with disjunction. http:\/\/www.mi.ras.ru\/&sim;bekl\/Papers\/primlog.pdf.","DOI":"10.1093\/logcom\/exs018"},{"key":"e_1_2_1_9_1","volume-title":"Handbook of Philosophical Logic","volume":"14","author":"Carnielli W. A."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Chagrov A. and Zakharyaschev M. 1997. Modal Logic. Oxford Logic Guides. Oxford University Press. Chagrov A. and Zakharyaschev M. 1997. Modal Logic. Oxford Logic Guides. Oxford University Press.","DOI":"10.1093\/oso\/9780198537793.001.0001"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/11.2.283"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-006-6607-2"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275431"},{"key":"e_1_2_1_14_1","first-page":"288","article-title":"Investigations into logical deduction","volume":"1","author":"Gentzen G.","year":"1964","journal-title":"Amer. Philos. Quart."},{"key":"e_1_2_1_15_1","unstructured":"Girard J. 1987. Proof Theory and Logical Complexity. Studies in Proof Theory. Bibliopolis. Girard J. 1987. Proof Theory and Logical Complexity. Studies in Proof Theory. Bibliopolis."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exn067"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275401"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzm058"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026753129680"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273755"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2977\/prims\/1195189604"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02716-1_22"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Poggiolesi F. 2010. Gentzen Calculi for Modal Propositional Logic: Trends in Logic. Studia Logica Library Springer. Poggiolesi F. 2010. Gentzen Calculi for Modal Propositional Logic: Trends in Logic. Studia Logica Library Springer.","DOI":"10.1007\/978-90-481-9670-8"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00293433"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/2963525"},{"key":"e_1_2_1_26_1","unstructured":"Takeuti G. 1975. Proof Theory. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company. Takeuti G. 1975. Proof Theory. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company."},{"key":"e_1_2_1_27_1","unstructured":"Troelstra A. S. and Schwichtenberg H. 1996. Basic Proof Theory. Cambridge University Press. Troelstra A. S. and Schwichtenberg H. 1996. Basic Proof Theory. Cambridge University Press."},{"key":"e_1_2_1_28_1","volume-title":"The Stanford Encyclopedia of Philosophy","author":"Verbrugge R. L.","year":"2010"},{"key":"e_1_2_1_29_1","volume-title":"Handbook of Philosophical Logic","author":"Wansing H.","edition":"2"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2528930","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2528930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:45Z","timestamp":1750231725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2528930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.1145\/2528930"],"URL":"https:\/\/doi.org\/10.1145\/2528930","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"2012-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-11-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}