The structure of multiplicatives
From MaRDI portal
Publication:1264140
DOI10.1007/BF01622878zbMath0689.03013MaRDI QIDQ1264140
Laurent Regnier, Vincent Danos
Publication date: 1989
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)
Related Items (98)
The shuffle Hopf algebra and noncommutative full completeness ⋮ A coding theoretic study of MLL proof nets ⋮ Softness of MALL proof-structures and a correctness criterion with Mix ⋮ Unnamed Item ⋮ On the \(\pi\)-calculus and linear logic ⋮ An Analytic Propositional Proof System on Graphs ⋮ Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs ⋮ Differential interaction nets ⋮ Weak typed Böhm theorem on IMLL ⋮ Interpolation in fragments of classical linear logic ⋮ Games and full completeness for multiplicative linear logic ⋮ Linear Läuchli semantics ⋮ Natural deduction and coherence for weakly distributive categories ⋮ Modeling linear logic with implicit functions ⋮ Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing ⋮ Proof Nets, Coends and the Yoneda Isomorphism ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simple free star-autonomous categories and full coherence ⋮ Glueing and orthogonality for models of linear logic ⋮ Chu spaces as a semantic bridge between linear logic and mathematics. ⋮ Handsome proof-nets: Perfect matchings and cographs ⋮ Additives of linear logic and normalization. I: A (restricted) Church-Rosser property. ⋮ A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic ⋮ Visible acyclic differential nets. I: Semantics ⋮ A proof of the focusing theorem via MALL proof nets ⋮ Combinatorial flows as bicolored atomic flows ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Proofs and surfaces ⋮ Light logics and optimal reduction: completeness and complexity ⋮ Complementary proof nets for classical logic ⋮ The conservation theorem for differential nets ⋮ A new correctness criterion for the proof nets of non-commutative multiplicative linear logics ⋮ Causal dependencies in multiplicative linear logic with MIX ⋮ Non-crossing Tree Realizations of Ordered Degree Sequences ⋮ Proof and refutation in MALL as a game ⋮ Unnamed Item ⋮ Proof nets for multiplicative cyclic linear logic and Lambek calculus ⋮ An algebraic correctness criterion for intuitionistic multiplicative proof-nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic ⋮ Unnamed Item ⋮ A decision procedure revisited: Notes on direct logic, linear logic and its implementation ⋮ Proof nets for classical logic ⋮ Parsing pregroup grammars and Lambek calculus using partial composition ⋮ Normalization of N-graphs via sub-N-graphs ⋮ Decision problems for propositional linear logic ⋮ Bounded linear logic: A modular approach to polynomial-time computability ⋮ Polynomial time in untyped elementary linear logic ⋮ Linear logic, coherence and dinaturality ⋮ Extended Lambek Calculi and First-Order Linear Logic ⋮ Two-dimensional linear algebra ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ Syllogisms in rudimentary linear logic, diagrammatically ⋮ A semantic measure of the execution time in linear logic ⋮ Correctness of linear logic proof structures is NL-complete ⋮ A linear algorithm for MLL proof net correctness and sequentialization ⋮ Intuitionistic differential nets and lambda-calculus ⋮ Stochastic Lambek Categorial Grammars ⋮ A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus ⋮ Proof nets and semi-star-autonomous categories ⋮ Modularity of proof-nets. Generating the type of a module. ⋮ Softness of hypercoherences and MALL full completeness ⋮ Coherent phase spaces. Semiclassical semantics ⋮ Parsing MELL proof nets ⋮ On categorical models of classical logic and the Geometry of Interaction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interpreting a finitary pi-calculus in differential interaction nets ⋮ Coherence for star-autonomous categories ⋮ Unnamed Item ⋮ Encoding Hamiltonian circuits into multiplicative linear logic ⋮ A Theory for Game Theories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ ! and ? – Storage as tensorial strength ⋮ The Cut-Elimination Theorem for Differential Nets with Promotion ⋮ Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic ⋮ Confluence of Pure Differential Nets with Promotion ⋮ The geometry of non-distributive logics ⋮ Connection-based proof construction in linear logic ⋮ Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing ⋮ Soft linear logic and polynomial time ⋮ Deep inference and expansion trees for second-order multiplicative linear logic ⋮ Connection methods in linear logic and proof nets construction ⋮ Non decomposable connectives of linear logic ⋮ \(\mathbb{Z}\)-modules and full completeness of multiplicative linear logic ⋮ Proof diagrams for multiplicative linear logic: syntax and semantics ⋮ Order-enriched categorical models of the classical sequent calculus ⋮ An abstract approach to stratification in linear logic ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ Observational Equivalence for the Interaction Combinators and Internal Separation ⋮ The additive multiboxes ⋮ Rewritings for Polarized Multiplicative and Exponential Proof Structures ⋮ A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. ⋮ Transcendental syntax I: deterministic case ⋮ A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
Cites Work
This page was built for publication: The structure of multiplicatives
