- Propositional intuitionistic multiple-conclusion calculus via proof graphs.Ruan V. B. Carvalho, Anjolina G. de Oliveira & Ruy J. G. B. de Queiroz - forthcoming - Logic Journal of the IGPL.details
|
|
Softness of hypercoherences and full completeness.Richard Blute, Masahiro Hamano & Philip Scott - 2005 - Annals of Pure and Applied Logic 131 (1-3):1-63.details
|
|
Proof nets and the lambda-calculus.Stefano Guerrini - 2004 - In Thomas Ehrhard (ed.), Linear logic in computer science. New York: Cambridge University Press. pp. 316--65.details
|
|
The additive multiboxes.Lorenzo Tortora de Falco - 2003 - Annals of Pure and Applied Logic 120 (1-3):65-102.details
|
|
Weak typed Böhm theorem on IMLL.Satoshi Matsuoka - 2007 - Annals of Pure and Applied Logic 145 (1):37-90.details
|
|
Proof and refutation in MALL as a game.Olivier Delande, Dale Miller & Alexis Saurin - 2010 - Annals of Pure and Applied Logic 161 (5):654-672.details
|
|
Modularity of proof-nets.Roberto Maieli & Quintijn Puite - 2005 - Archive for Mathematical Logic 44 (2):167-193.details
|
|
Canonical proof nets for classical logic.Richard McKinley - 2013 - Annals of Pure and Applied Logic 164 (6):702-732.details
|
|
Linear logic.Roberto Di Cosmo & Dale Miller - unknown - Stanford Encyclopedia of Philosophy.details
|
|
(1 other version)The shuffle Hopf algebra and noncommutative full completeness.R. F. Blute & P. J. Scott - 1998 - Journal of Symbolic Logic 63 (4):1413-1436.details
|
|
Complementary Proof Nets for Classical Logic.Gabriele Pulcini & Achille C. Varzi - 2023 - Logica Universalis 17 (4):411-432.details
|
|
Proofs and surfaces.Djordje Baralić, Pierre-Louis Curien, Marina Milićević, Jovana Obradović, Zoran Petrić, Mladen Zekić & Rade T. Živaljević - 2020 - Annals of Pure and Applied Logic 171 (9):102845.details
|
|
Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28-August 3, 2005. Cambridge: Cambridge University Press. pp. 151-172.details
|
|
Syllogisms in Rudimentary Linear Logic, Diagrammatically.Ruggero Pagnan - 2013 - Journal of Logic, Language and Information 22 (1):71-113.details
|
|
The Geometry of Non-Distributive Logics.Greg Restall & Francesco Paoli - 2005 - Journal of Symbolic Logic 70 (4):1108 - 1126.details
|
|
Non decomposable connectives of linear logic.Roberto Maieli - 2019 - Annals of Pure and Applied Logic 170 (11):102709.details
|
|
Games and full completeness for multiplicative linear logic.Abramsky Samson & Jagadeesan Radha - 1994 - Journal of Symbolic Logic 59 (2):543-574.details
|
|
Questions and answers–a category arising in linear logic, complexity theory, and set theory.Andreas Blass - 1995 - In Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.), Advances in linear logic. New York, NY, USA: Cambridge University Press. pp. 222--61.details
|
|
Decision problems for propositional linear logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.details
|
|
Linear Läuchli semantics.R. F. Blute & P. J. Scott - 1996 - Annals of Pure and Applied Logic 77 (2):101-142.details
|
|
A new correctness criterion for cyclic proof nets.V. Michele Abrusci & Elena Maringelli - 1998 - Journal of Logic, Language and Information 7 (4):449-459.details
|
|
Softness of MALL proof-structures and a correctness criterion with Mix.Masahiro Hamano - 2004 - Archive for Mathematical Logic 43 (6):751-794.details
|
|
Interpolation in fragments of classical linear logic.Dirk Roorda - 1994 - Journal of Symbolic Logic 59 (2):419-444.details
|
|
(1 other version)A new correctness criterion for the proof nets of non-commutative multiplicative linear logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.details
|
|
A topological correctness criterion for non-commutative logic.Paul-André Mellies - 2004 - In Thomas Ehrhard (ed.), Linear logic in computer science. New York: Cambridge University Press. pp. 283--323.details
|
|
Grammar and logic.Glyn Morrill - 1996 - Theoria 62 (3):260-293.details
|
|
Modeling linear logic with implicit functions.Sergey Slavnov - 2014 - Annals of Pure and Applied Logic 165 (1):357-370.details
|
|
Coherent phase spaces. Semiclassical semantics.Sergey Slavnov - 2005 - Annals of Pure and Applied Logic 131 (1-3):177-225.details
|
|
Visible acyclic differential nets, Part I: Semantics.Michele Pagani - 2012 - Annals of Pure and Applied Logic 163 (3):238-265.details
|
|
Z-modules and full completeness of multiplicative linear logic.Masahiro Hamano - 2001 - Annals of Pure and Applied Logic 107 (1-3):165-191.details
|
|
Coherence for star-autonomous categories.Kosta Došen & Zoran Petrić - 2006 - Annals of Pure and Applied Logic 141 (1):225-242.details
|
|
Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition.Denis Béchet - 2007 - Studia Logica 87 (2-3):199-224.details
|
|