{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:36Z","timestamp":1753889976899,"version":"3.41.2"},"reference-count":14,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2010,12,25]],"date-time":"2010-12-25T00:00:00Z","timestamp":1293235200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Canonical inference rules and canonical systems are defined in the framework\nof non-strict single-conclusion sequent systems, in which the succeedents of\nsequents can be empty. Important properties of this framework are investigated,\nand a general non-deterministic Kripke-style semantics is provided. This\ngeneral semantics is then used to provide a constructive (and very natural),\nsufficient and necessary coherence criterion for the validity of the strong\ncut-elimination theorem in such a system. These results suggest new syntactic\nand semantic characterizations of basic constructive connectives.<\/jats:p>","DOI":"10.2168\/lmcs-6(4:12)2010","type":"journal-article","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T13:29:57Z","timestamp":1316784597000},"source":"Crossref","is-referenced-by-count":6,"title":["On Constructive Connectives and Systems"],"prefix":"10.46298","volume":"Volume 6, Issue 4","author":[{"given":"Arnon","family":"Avron","sequence":"first","affiliation":[]},{"given":"Ori","family":"Lahav","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2010,12,25]]},"reference":[{"key":"10.2168\/LMCS-6(4:12)2010_av:9simple","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90023-U"},{"key":"10.2168\/LMCS-6(4:12)2010_Av93","doi-asserted-by":"publisher","DOI":"10.1007\/BF00881838"},{"key":"10.2168\/LMCS-6(4:12)2010_AL05","unstructured":"Avron, A., Lev, I.: Non-deterministic Multiple-valued Structures. Journal of Logic and Computation 15, 24-261 (2005). A partial conference version in Gor\u00e9, R., Leitsch, A., Nipkow, T., (eds.): Proceedings of IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 529-544. Springer, Heidelberg (2001)."},{"key":"10.2168\/LMCS-6(4:12)2010_AL10","unstructured":"Avron, A., Lahav, O.: Strict Canonical constructive systems. In Blass, A., Dershowitz, N., Reisig, W. (eds.): Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, 75-94, Lecture Notes in Computer Science, volume 6300, Springer-Verlag, 2010. A conference version in M. Giese, A. Waaler (eds.): Proceedings of TABLEAUX 2009, 62-76, LNAI 5607, Springer (2009)."},{"key":"10.2168\/LMCS-6(4:12)2010_AZ08","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-4(3:2)2008"},{"key":"10.2168\/LMCS-6(4:12)2010_belnap-tonk","doi-asserted-by":"publisher","DOI":"10.2307\/3326862"},{"key":"10.2168\/LMCS-6(4:12)2010_Bowen","doi-asserted-by":"crossref","unstructured":"Bowen, K. A.: An extension of the intuitionistic propositional calculus. Indagationes Mathematicae 33, 287-294 (1971).","DOI":"10.1016\/S1385-7258(71)80036-7"},{"key":"10.2168\/LMCS-6(4:12)2010_CT06","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-006-6607-2"},{"key":"10.2168\/LMCS-6(4:12)2010_gentzen69","unstructured":"Gentzen, G.: Investigations into Logical Deduction. In: Szabo, M.E. (ed.) The Collected Works of Gerhard Gentzen, pp. 68-131. North Holland, Amsterdam (1969)."},{"key":"10.2168\/LMCS-6(4:12)2010_gu09","unstructured":"Gurevich, Y., Neeman, I.: The Infon Logic: the Propositional Case. To appear in ACM Transactions on Computation Logic 12 (2011). An earlier version in Bulletin of European Association of Theoretical Computer Science, number 98 (2009) 150-178."},{"key":"10.2168\/LMCS-6(4:12)2010_Kr65","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71685-9"},{"key":"10.2168\/LMCS-6(4:12)2010_McCullough","doi-asserted-by":"publisher","DOI":"10.2307\/2271511"},{"key":"10.2168\/LMCS-6(4:12)2010_pr:60","doi-asserted-by":"publisher","DOI":"10.2307\/3326699"},{"key":"10.2168\/LMCS-6(4:12)2010_handbook-sundholm","doi-asserted-by":"crossref","unstructured":"Sundholm, G.: Proof theory and Meaning. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 9, pp. 165-198 (2002).","DOI":"10.1007\/978-94-017-0464-9_3"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/967\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/967\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:00:06Z","timestamp":1681243206000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,25]]},"references-count":14,"URL":"https:\/\/doi.org\/10.2168\/lmcs-6(4:12)2010","relation":{"is-same-as":[{"id-type":"arxiv","id":"1011.4384","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1011.4384","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/s10817-013-9273-x","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2010,12,25]]},"article-number":"967"}}