{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T20:55:43Z","timestamp":1791406543020,"version":"4.3.3"},"reference-count":30,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2021,5,1]]},"abstract":"<jats:p>We propose a new direct presentation of full (propositional) classical logic by means of proof nets, for which strong normalization and confluence hold true. Our proposal is based on the breaking of symmetry between propositional connectives, combined with a principle of focusing\/defocusing.<\/jats:p>","DOI":"10.1215\/00294527-2021-0016","type":"journal-article","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T11:32:35Z","timestamp":1623238355000},"page":"303-343","source":"Crossref","is-referenced-by-count":0,"title":["Proof Nets for Classical Logic"],"prefix":"10.1215","volume":"62","author":[{"given":"Stefano","family":"Guerrini","sequence":"first","affiliation":[{"name":"Laboratoire d\u2019Informatique de Paris Nord (LIPN), Institut Galil\u00e9e, Univ. Paris 13, Sorbonne Paris Cit\u00e9, France  http:\/\/lipn.univ-paris13.fr\/~guerrini"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Masini","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 di Verona, Verona, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"Acclavio, M., and L. Stra\u00dfburger, \u201cFrom syntactic proofs to combinatorial proofs,\u201d pp. 481\u201397 in <i>Automated Reasoning<\/i>, edited by D. Galmiche, S. Schulz, and R. Sebastiani, vol. 10900 of <i>Lecture Notes in Computer Science<\/i>, Springer, Cham, 2018.","DOI":"10.1007\/978-3-319-94205-6"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Andreoli, J.-M., \u201cLogic programming with focusing proofs in linear logic,\u201d <i>Journal of Logic and Computation<\/i>, vol. 2 (1992), pp. 297\u2013347.","DOI":"10.1093\/logcom\/2.3.297"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Aschieri, F., and M. Zorzi, \u201cOn natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand\u2019s theorem,\u201d <i>Theoretical Computer Science<\/i>, vol. 625 (2016), pp. 125\u201346.","DOI":"10.1016\/j.tcs.2016.02.028"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Curien, P.-L., and H. Herbelin, \u201cThe duality of computation,\u201d pp. 233\u201343 in <i>Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP) \u201900 (Montreal, 2000<\/i>, edited by M. Odersky and P. Wadler, ACM, New York, 2000.","DOI":"10.1145\/357766.351262"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Danos, V., J.-B. Joinet, and H. Schellinx, \u201cA new deconstructive logic: Linear logic,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 62 (1997), pp. 755\u2013807.","DOI":"10.2307\/2275572"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Danos, V., and L. Regnier, \u201cThe structure of multiplicatives,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 28 (1989), pp. 181\u2013203.","DOI":"10.1007\/BF01622878"},{"key":"7","doi-asserted-by":"crossref","unstructured":"Gentzen, G., \u201cInvestigations into logical deduction,\u201d pp. 68\u2013131, in <i>The Collected Papers of Gerhard Gentzen<\/i>, edited by M. E. Szabo, vol. 55 of <i>Studies in Logic and The Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1969.","DOI":"10.1016\/S0049-237X(08)70822-X"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Girard, J.-Y., \u201cLinear logic,\u201d <i>Theoretical Computer Science<\/i>, vol. 50 (1987), no. 1.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Girard, J.-Y., \u201cA new constructive logic: Classical logic,\u201d <i>Mathematical Structures in Computer Science<\/i>, vol. 1 (1991), pp. 255\u201396.","DOI":"10.1017\/S0960129500001328"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Girard, J.-Y., \u201cLinear logic: Its syntax and semantics,\u201d pp. 1\u201342 in <i>Advances in Linear Logic (Ithaca, 1993)<\/i>, edited by J.-Y. Girard, Y. Lafont, and L. Regnier, vol. 222 of <i>London Mathematical Society Lecture Note Series<\/i>, Cambridge University Press, Cambridge, 1995.","DOI":"10.1017\/CBO9780511629150.002"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Girard, J.-Y., \u201cLocus solum: From the rules of logic to the logic of rules,\u201d <i>Mathematical Structures in Computer Science<\/i>, vol. 11 (2001), pp. 301\u2013506.","DOI":"10.1017\/S096012950100336X"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Guerrini, S., and A. Masini, \u201cParsing MELL proof nets,\u201d <i>Theoretical Computer Science<\/i>, vol. 254 (2001), pp. 317\u201335.","DOI":"10.1016\/S0304-3975(99)00299-6"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Guerrini, S., and A. Masini, \u201cProofs, tests and continuation passing style,\u201d <i>ACM Transactions on Computational Logic<\/i>, vol. 10 (2009), no. 2, art. ID 12.","DOI":"10.1145\/1462179.1462184"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Hughes, D. J. D., \u201cProofs without syntax,\u201d <i>Annals of Mathematics (2)<\/i>, vol. 164 (2006), pp. 1065\u201376.","DOI":"10.4007\/annals.2006.164.1065"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Hughes, D. J. D., \u201cTowards Hilbert\u2019s 24th problem: Combinatorial proof invariants (preliminary version),\u201d pp. 37\u201363 in <i>13th Workshop on Logic, Language, Information and Computation (WoLLIC, 2006)<\/i>, edited by G. Mints and R. de Queiroz, vol. 165 of <i>Electronic Notes in Theoretical Computer Science<\/i>, Elsevier, Amsterdam, 2006.","DOI":"10.1016\/j.entcs.2006.05.036"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Lafont, Y., \u201cFrom proof nets to interaction nets,\u201d pp. 225\u201347 in <i>Advances in Linear Logic (Ithaca, 1993)<\/i>, edited by J.-Y. Girard, Y. Lafont, and L. Regnier, vol. 222 of <i>London Mathematical Society Lecture Note Series<\/i>, Cambridge University Press, Cambridge, Cambridge, 1995.","DOI":"10.1017\/CBO9780511629150.012"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Lamarche, F., and L. Stra\u00dfburger, \u201cNaming proofs in classical propositional logic,\u201d pp. 246\u201361 in <i>Typed Lambda Calculi and Applications<\/i>, edited by P. Urzyczyn, vol. 3461 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2005.","DOI":"10.1007\/11417170_19"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Laurent, O., \u201cPolarized proof-nets: Proof-nets for LC,\u201d pp. 213\u201327 in <i>Typed Lambda Calculi and Applications (L\u2019Aquila, 1999)<\/i>, edited by J.-Y. Girard, vol. 1581 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 1999.","DOI":"10.1007\/3-540-48959-2_16"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Laurent, O., \u201cPolarized proof-nets and <math xmlns=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\" alttext=\"$\\lambda \\upmu $\"><mi mathvariant=\"italic\">\u03bb<\/mi><mi mathvariant=\"normal\">\u03bc<\/mi><\/math>-calculus,\u201d <i>Theoretical Computer Science<\/i>, vol. 290 (2003), pp. 161\u201388.","DOI":"10.1016\/S0304-3975(01)00297-3"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Laurent, O., M. Quatrini, and L. T. de Falco, \u201cPolarized and focalized linear and classical proofs,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 134 (2005), pp. 217\u201364.","DOI":"10.1016\/j.apal.2004.11.002"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Liang, C., and D. Miller, \u201cFocusing and polarization in linear, intuitionistic, and classical logics,\u201d <i>Theoretical Computer Science<\/i>, vol. 410 (2009), pp. 4747\u201368.","DOI":"10.1016\/j.tcs.2009.07.041"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Liang, C., and D. Miller, \u201cA focused approach to combining logics,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 162 (2011), pp. 679\u201397.","DOI":"10.1016\/j.apal.2011.01.012"},{"key":"23","doi-asserted-by":"publisher","unstructured":"McKinley, R., \u201cCanonical proof nets for classical logic,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 164 (2013), pp. 702\u201332.","DOI":"10.1016\/j.apal.2012.05.007"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Pagani, M., and L. T. de Falco, \u201cStrong normalization property for second order linear logic,\u201d <i>Theoretical Computer Science<\/i>, vol. 411 (2010), pp. 410\u201344.","DOI":"10.1016\/j.tcs.2009.07.053"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Parigot, M., \u201c<math xmlns=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\" alttext=\"$\\lambda \\upmu $\"><mi mathvariant=\"italic\">\u03bb<\/mi><mi mathvariant=\"normal\">\u03bc<\/mi><\/math>-calculus: An algorithmic interpretation of classical natural deduction,\u201d pp. 190\u2013201 in <i>Logic Programming and Automated Reasoning (St. Petersburg, 1992)<\/i>, edited by A. Voronkov, vol. 624 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 1992.","DOI":"10.1007\/BFb0013061"},{"key":"26","doi-asserted-by":"publisher","unstructured":"Parigot, M., \u201cProofs of strong normalisation for second order classical natural deduction,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 62 (1997), pp. 1461\u201379.","DOI":"10.2307\/2275652"},{"key":"27","unstructured":"Regnier, L., \u201cLambda-calcul et r\u00e9seaux,\u201d PhD dissertation, Universit\u00e9 Paris 7, Paris, 1992."},{"key":"28","doi-asserted-by":"publisher","unstructured":"Robinson, E., \u201cProof nets for classical logic,\u201d <i>Journal of Logic and Computation<\/i>, vol. 13 (2003), pp. 777\u201397.","DOI":"10.1093\/logcom\/13.5.777"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Selinger, P., \u201cControl categories and duality: On the categorical semantics of the lambda-mu calculus,\u201d <i>Mathematical Structures in Computer Science<\/i>, vol. 11 (2001), pp. 207\u201360.","DOI":"10.1017\/S096012950000311X"},{"key":"30","unstructured":"Urban, C., and G. M. Bierman, \u201cStrong normalisation of cut-elimination in classical logic,\u201d <i>Fundamenta Informaticae<\/i>, vol. 45 (2001), pp. 123\u201355."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2021-0016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T20:33:09Z","timestamp":1791405189000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-62\/issue-2\/Proof-Nets-for-Classical-Logic\/10.1215\/00294527-2021-0016.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,1]]},"references-count":30,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,5,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2021-0016","relation":{},"ISSN":["0029-4527","1939-0726"],"issn-type":[{"value":"0029-4527","type":"print"},{"value":"1939-0726","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,1]]}}}