Recommendations
Cited in
(only showing first 100 items - show all)- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- On the \(\pi\)-calculus and linear logic
- scientific article; zbMATH DE number 4091500 (Why is no real title available?)
- A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
- Light logics and optimal reduction: completeness and complexity
- Causal dependencies in multiplicative linear logic with MIX
- Modeling linear logic with implicit functions
- A semantic measure of the execution time in linear logic
- Chu spaces as a semantic bridge between linear logic and mathematics.
- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
- Coherence for star-autonomous categories
- scientific article; zbMATH DE number 7471668 (Why is no real title available?)
- Decision problems for propositional linear logic
- Proof nets and semi-star-autonomous categories
- \(\mathbb{Z}\)-modules and full completeness of multiplicative linear logic
- The conservation theorem for differential nets
- Intuitionistic differential nets and lambda-calculus
- Two-dimensional linear algebra
- Easy multiplications. I: The realm of Kleene's theorem
- Games and full completeness for multiplicative linear logic
- Connection methods in linear logic and proof nets construction
- A graph-theoretic approach to sequent derivability in the Lambek calculus
- ! and ? – Storage as tensorial strength
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
- The geometry of non-distributive logics
- A Theory for Game Theories
- Coherent phase spaces. Semiclassical semantics
- Bounded linear logic: A modular approach to polynomial-time computability
- Modularity of proof-nets. Generating the type of a module.
- Visible acyclic differential nets. I: Semantics
- Differential interaction nets
- Soft linear logic and polynomial time
- Interpreting a finitary pi-calculus in differential interaction nets
- A decision procedure revisited: Notes on direct logic, linear logic and its implementation
- Softness of MALL proof-structures and a correctness criterion with Mix
- Linear logic, coherence and dinaturality
- The additive multiboxes
- Confluence of Pure Differential Nets with Promotion
- Natural deduction and coherence for weakly distributive categories
- A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
- Interpolation in fragments of classical linear logic
- Parsing MELL proof nets
- Proofs and surfaces
- Order-enriched categorical models of the classical sequent calculus
- Simple free star-autonomous categories and full coherence
- Softness of hypercoherences and MALL full completeness
- Normalization of N-graphs via sub-N-graphs
- Handsome proof-nets: Perfect matchings and cographs
- On categorical models of classical logic and the Geometry of Interaction
- scientific article; zbMATH DE number 7204441 (Why is no real title available?)
- Weak typed Böhm theorem on IMLL
- Connection-based proof construction in linear logic
- Additives of linear logic and normalization. I: A (restricted) Church-Rosser property.
- An abstract approach to stratification in linear logic
- A linear algorithm for MLL proof net correctness and sequentialization
- Correctness of linear logic proof structures is NL-complete
- Proof and refutation in MALL as a game
- scientific article; zbMATH DE number 7359406 (Why is no real title available?)
- Transcendental syntax I: deterministic case
- Proof nets, coends and the Yoneda isomorphism
- The shuffle Hopf algebra and noncommutative full completeness
- Linear Läuchli semantics
- Glueing and orthogonality for models of linear logic
- Extended Lambek calculi and first-order linear logic
- scientific article; zbMATH DE number 7471682 (Why is no real title available?)
- Event domains, stable functions and proof-nets
- Observational equivalence for the interaction combinators and internal separation
- Rewritings for polarized multiplicative and exponential proof structures
- A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
- scientific article; zbMATH DE number 1231514 (Why is no real title available?)
- scientific article; zbMATH DE number 7559288 (Why is no real title available?)
- Non decomposable connectives of linear logic
- Exponentially handsome proof nets and their normalization
- Local validity for circular proofs in linear logic with fixed points
- Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
- An Analytic Propositional Proof System on Graphs
- Polynomial time in untyped elementary linear logic
- Parsing pregroup grammars and Lambek calculus using partial composition
- Proof nets for multiplicative cyclic linear logic and Lambek calculus
- Proof-search and proof nets in mixed linear logic
- Complementary proof nets for classical logic
- Syllogisms in rudimentary linear logic, diagrammatically
- Stochastic Lambek categorial grammars
- Proof nets for classical logic
- A proof of the focusing theorem via MALL proof nets
- Cyclic multiplicative proof nets of linear logic with an application to language parsing
- Proof diagrams for multiplicative linear logic: syntax and semantics
- A coding theoretic study of MLL proof nets
- Proof diagrams for multiplicative linear logic
- Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing
- scientific article; zbMATH DE number 7204450 (Why is no real title available?)
- scientific article; zbMATH DE number 7533340 (Why is no real title available?)
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- An algebraic correctness criterion for intuitionistic multiplicative proof-nets
- Combinatorial flows as bicolored atomic flows
- The Cut-Elimination Theorem for Differential Nets with Promotion
- Encoding Hamiltonian circuits into multiplicative linear logic
- Non-crossing tree realizations of ordered degree sequences
- Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
- Deep inference and expansion trees for second-order multiplicative linear logic
This page was built for publication: The structure of multiplicatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264140)