On the public citation graph

The structure of multiplicatives

https://doi.org/10.1007/bf01622878
0 signed · 293 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48088-3_1openalex-snapshot
Geometry of Deduction Via Graphs of Proofs
inferred← citeshttps://doi.org/10.1007/0-306-48088-3_2openalex-snapshot
Chu’s Construction: A Proof-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/10704567_10openalex-snapshot
A Calculus for Interaction Nets
inferred← citeshttps://doi.org/10.1007/11787006_34openalex-snapshot
Commutative Locative Quantifiers for Multiplicative Linear Logic
inferred← citeshttps://doi.org/10.1007/11821069_4openalex-snapshot
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions
inferred← citeshttps://doi.org/10.1007/11874683_35openalex-snapshot
Acyclicity and Coherence in Multiplicative Exponential Linear Logic
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_17openalex-snapshot
Proof-Search in Implicative Linear Logic as a Matching Problem
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_18openalex-snapshot
Partially Additive Categories and Fully Complete Models of Linear Logic
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_28openalex-snapshot
Evolving Games and Essential Nets for Affine Polymorphism
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_39openalex-snapshot
Focussing Proof-Net Construction as a Middleware Paradigm
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_6openalex-snapshot
Strong Normalization of Proof Nets Modulo Structural Congruences
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_16openalex-snapshot
Polarized Proof-Nets: Proof-Nets for LC
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_3openalex-snapshot
Modules in Non-commutative Logic
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_12openalex-snapshot
A Matrix Characterization for $$ \mathcal{M}\mathcal{E}\mathcal{L}\mathcal{L} $$
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_209openalex-snapshot
Xpnet: A graphical interface to proof nets with an efficient proof checker
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_15openalex-snapshot
A typed foundation for directional logic programming
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_5openalex-snapshot
Yet another correctness criterion for Multiplicative Linear Logic with MIX
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_43openalex-snapshot
Pomset logic: A non-commutative extension of classical linear logic
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_14openalex-snapshot
An algebraic correctness criterion for intuitionistic proof-nets
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_20openalex-snapshot
Connection-based proof construction in linear logic
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_17openalex-snapshot
Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-62077-6_2openalex-snapshot
Transcendental Syntax iv: Logic Without Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-63787-3_2openalex-snapshot
Partial Orders, Residuation, and First-Order Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_16openalex-snapshot
A Formal Model for a Linear Time Correctness Condition of Proof Nets of Multiplicative Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_1openalex-snapshot
A Proof of the Focusing Theorem via MALL Proof Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_9openalex-snapshot
Combinatorial Flows as Bicolored Atomic Flows
inferred← citeshttps://doi.org/10.1007/978-3-031-62687-6_13openalex-snapshot
Lambek Calculus with Banged Atoms for Parasitic Gaps
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_12openalex-snapshot
Sequent Systems on Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-84924-4_13openalex-snapshot
Enhancing a Hierarchical Graph Rewriting Language Based on MELL Cut Elimination
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_2openalex-snapshot
Formulas as Processes, Deadlock-Freedom as Choreographies
inferred← citeshttps://doi.org/10.1007/978-3-032-21143-9_5openalex-snapshot
Representation of Probabilities and Reasoning by Means of Proofs of Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_4openalex-snapshot
Proof Nets for PiL
inferred← citeshttps://doi.org/10.1007/978-3-319-50422-3_10openalex-snapshot
The Grail Theorem Prover: Type Theory for Syntax and Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-90686-7_2openalex-snapshot
Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_14openalex-snapshot
On Proof Nets for Multiplicative Linear Logic with Units
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_3openalex-snapshot
Concurrent Construction of Proof-Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7openalex-snapshot
Logical foundations of computer science : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_28openalex-snapshot
Uniform Circuits, & Boolean Proof Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_26openalex-snapshot
A Characterization of Medial as Rewriting Rule
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_27openalex-snapshot
Asynchronous Games: Innocence Without Alternation
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_33openalex-snapshot
Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_27openalex-snapshot
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_34openalex-snapshot
Permutative Additives and Exponentials
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3openalex-snapshot
FSTTCS 2007 : foundations of software technology and theoretical computer science : 27th International Conference, New Delhi, India, December 12-14, 2007 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_16openalex-snapshot
A Theory for Game Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_19openalex-snapshot
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_17openalex-snapshot
The Cut-Elimination Theorem for Differential Nets with Promotion
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_23openalex-snapshot
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_36openalex-snapshot
Confluence of Pure Differential Nets with Promotion
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_22openalex-snapshot
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_45openalex-snapshot
What Is the Problem with Proof Nets for Classical Logic?
inferred← citeshttps://doi.org/10.1007/978-3-642-14322-9_5openalex-snapshot
LC Graphs for the Lambek Calculus with Product
inferred← citeshttps://doi.org/10.1007/978-3-642-15331-0openalex-snapshot
Foundational and Practical Aspects of Resource Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-15331-0_9openalex-snapshot
Non-deterministic Boolean Proof Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_38openalex-snapshot
Expansion Nets: Proof-Nets for Propositional Classical Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-31555-8_5openalex-snapshot
The Multimodal Lambek Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-31555-8_6openalex-snapshot
Lambek Calculus and Linear Logic: Proof Nets as Parse Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_20openalex-snapshot
Proofs as Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-39992-3_7openalex-snapshot
Linear Time Proof Verification on N-Graphs: A Graph Theoretic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-54789-8_17openalex-snapshot
Extended Lambek Calculi and First-Order Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-54789-8_7openalex-snapshot
Learning Lambek Grammars from Proof Frames
inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_20openalex-snapshot
Measurements in Proof Nets as Higher-Order Quantum Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_3openalex-snapshot
Linear Logic: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_7openalex-snapshot
On the Meaning of Logical Rules I: Syntax Versus Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-44145-9_7openalex-snapshot
Sequentialization for N-Graphs via Sub-N-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_28openalex-snapshot
On the Dependencies of Logical Rules
inferred← citeshttps://doi.org/10.1007/978-3-662-47709-0_5openalex-snapshot
Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing
inferred← citeshttps://doi.org/10.1007/978-3-662-53042-9_3openalex-snapshot
Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing
inferred← citeshttps://doi.org/10.1007/978-3-662-53826-5_13openalex-snapshot
Non-crossing Tree Realizations of Ordered Degree Sequences
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_18openalex-snapshot
Proof-Net as Graph, Taylor Expansion as Pullback
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_1openalex-snapshot
Labelled Proof Systems for Intuitionistic Provability
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_10openalex-snapshot
Proof Structures and Matrix Graphs
inferred← citeshttps://doi.org/10.1007/bfb0013047openalex-snapshot
A procedure for automatic proof nets construction
inferred← citeshttps://doi.org/10.1007/bfb0013461openalex-snapshot
Proof nets and coherence theorems
inferred← citeshttps://doi.org/10.1007/bfb0023757openalex-snapshot
Provability in TBLL: A decision procedure
inferred← citeshttps://doi.org/10.1007/bfb0023870openalex-snapshot
Automated deduction in additive and multiplicative linear logic
inferred← citeshttps://doi.org/10.1007/bfb0026986openalex-snapshot
Specifying interaction categories
inferred← citeshttps://doi.org/10.1007/bfb0027011openalex-snapshot
Proof net semantics of proof search computation
inferred← citeshttps://doi.org/10.1007/bfb0052154openalex-snapshot
Constructing different phonological bracketings from a proof net
inferred← citeshttps://doi.org/10.1007/bfb0052164openalex-snapshot
Generation as deduction on labelled proof nets
inferred← citeshttps://doi.org/10.1007/s00153-004-0222-6openalex-snapshot
Softness of MALL proof-structures and a correctness criterion with Mix
inferred← citeshttps://doi.org/10.1007/s00153-004-0242-2openalex-snapshot
Modularity of proof-nets
inferred← citeshttps://doi.org/10.1007/s001530050083openalex-snapshot
On the Jordan-Hölder decomposition of proof nets
inferred← citeshttps://doi.org/10.1007/s001530100127openalex-snapshot
A new correctness criterion for multiplicative non-commutative proof nets
inferred← citeshttps://doi.org/10.1007/s10817-018-9466-4openalex-snapshot
Proof Diagrams for Multiplicative Linear Logic: Syntax and Semantics
inferred← citeshttps://doi.org/10.1007/s10849-012-9170-4openalex-snapshot
Syllogisms in Rudimentary Linear Logic, Diagrammatically
inferred← citeshttps://doi.org/10.1007/s11168-007-9034-2openalex-snapshot
A Chronicle of Type Logical Grammar: 1935–1994
inferred← citeshttps://doi.org/10.1007/s11225-007-9084-3openalex-snapshot
Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition
inferred← citeshttps://doi.org/10.1007/s11787-023-00337-9openalex-snapshot
Complementary Proof Nets for Classical Logic
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00159-xopenalex-snapshot
Natural deduction and coherence for weakly distributive categories
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90075-bopenalex-snapshot
Decision problems for propositional linear logic
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00017-8openalex-snapshot
Linear Läuchli semantics
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90069-ropenalex-snapshot
A decision procedure revisited: notes on direct logic, linear logic and its implementation
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90386-topenalex-snapshot
Bounded linear logic: a modular approach to polynomial-time computability
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90053-vopenalex-snapshot
Linear logic, coherence and dinaturality
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00104-9openalex-snapshot
On the π-calculus and linear logic
inferred← citeshttps://doi.org/10.1016/b0-08-044854-2/00891-9openalex-snapshot
Categorial Grammars: Deductive Approaches
inferred← citeshttps://doi.org/10.1016/b978-0-444-52869-8.50008-6openalex-snapshot
Quantum Logic and Nonclassical Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2004.05.002openalex-snapshot
Softness of hypercoherences and MALL full completeness
inferred← citeshttps://doi.org/10.1016/j.apal.2004.05.003openalex-snapshot
Coherent phase spaces. Semiclassical semantics
inferred← citeshttps://doi.org/10.1016/j.apal.2005.11.003openalex-snapshot
Coherence for star-autonomous categories
inferred← citeshttps://doi.org/10.1016/j.apal.2006.06.001openalex-snapshot
Weak typed Böhm theorem on IMLL
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.017openalex-snapshot
Proof and refutation in MALL as a game
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.001openalex-snapshot
Visible acyclic differential nets, Part I: Semantics
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.007openalex-snapshot
Canonical proof nets for classical logic
inferred← citeshttps://doi.org/10.1016/j.apal.2013.07.018openalex-snapshot
Modeling linear logic with implicit functions
inferred← citeshttps://doi.org/10.1016/j.apal.2019.05.006openalex-snapshot
Non decomposable connectives of linear logic
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102845openalex-snapshot
Proofs and surfaces
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.060openalex-snapshot
Differential Interaction Nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.004openalex-snapshot
Symmetric Monoidal Sketches and Categories of Wirings
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.036openalex-snapshot
Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.030openalex-snapshot
Observational Equivalence for the Interaction Combinators and Internal Separation
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.003openalex-snapshot
Event Domains, Stable Functions and Proof-Nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.037openalex-snapshot
Rewritings for Polarized Multiplicative and Exponential Proof Structures
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.06.002openalex-snapshot
Normalization of N-Graphs via Sub-N-Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.005openalex-snapshot
Interpreting a finitary pi-calculus in differential interaction nets
inferred← citeshttps://doi.org/10.1016/j.ic.2010.10.002openalex-snapshot
Light logics and optimal reduction: Completeness and complexity
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.006openalex-snapshot
An abstract approach to stratification in linear logic
inferred← citeshttps://doi.org/10.1016/j.jpaa.2005.03.016openalex-snapshot
Order-enriched categorical models of the classical sequent calculus
inferred← citeshttps://doi.org/10.1016/j.jpaa.2012.03.020openalex-snapshot
Simple free star-autonomous categories and full coherence
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.018openalex-snapshot
Soft linear logic and polynomial time
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.003openalex-snapshot
Differential interaction nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.017openalex-snapshot
A semantic measure of the execution time in linear logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.020openalex-snapshot
Correctness of linear logic proof structures is NL -complete
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.021openalex-snapshot
A linear algorithm for MLL proof net correctness and sequentialization
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.022openalex-snapshot
Intuitionistic differential nets and lambda-calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.002openalex-snapshot
Polynomial time in untyped elementary linear logic
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00029-4openalex-snapshot
Z-modules and full completeness of multiplicative linear logic
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00042-8openalex-snapshot
The additive multiboxes
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00381-9openalex-snapshot
Encoding Hamiltonian circuits into multiplicative linear logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00169-4openalex-snapshot
Chu spaces as a semantic bridge between linear logic and mathematics
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00175-xopenalex-snapshot
Handsome proof-nets: perfect matchings and cographs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00176-1openalex-snapshot
Additives of linear logic and normalization—Part I: a (restricted) Church–Rosser property
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00178-5openalex-snapshot
A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00241-9openalex-snapshot
Glueing and orthogonality for models of linear logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00024-5openalex-snapshot
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00309-0openalex-snapshot
An algebraic correctness criterion for intuitionistic multiplicative proof-nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00049-3openalex-snapshot
Reversible, irreversible and optimal λ-machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00176-0openalex-snapshot
Connection methods in linear logic and proof nets construction
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00299-6openalex-snapshot
Parsing MELL proof nets
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80910-1openalex-snapshot
Two-dimensional linear algebra
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01137-0openalex-snapshot
Proof-search and Proof Nets in Mixed Linear Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01179-5openalex-snapshot
Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80152-5openalex-snapshot
Towards Full Completeness of the Linear Logic of Chu Spaces
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80402-5openalex-snapshot
Reversible, Irreversible and Optimal λ-machines
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80411-6openalex-snapshot
Some remarks on cyclic linear logic preliminary report
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80416-5openalex-snapshot
Perfect matchings and series-parallel graphs: multiplicatives proof nets as R&B-graphs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80419-0openalex-snapshot
Remarks on Elementary Linear Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82517-4openalex-snapshot
A Noncommutative Full Completeness Theorem
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82572-1openalex-snapshot
Stochastic Lambek Categorial Grammars
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82589-7openalex-snapshot
A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/9781009625715openalex-snapshot
An Introduction to String Diagrams for Computer Scientists
inferred← citeshttps://doi.org/10.1017/9781316755785.006openalex-snapshot
Geometry of interaction IV: the feedback equation
inferred← citeshttps://doi.org/10.1017/cbo9780511546464.012openalex-snapshot
Proofnets for S5: Sequents and circuits for modal logic
inferred← citeshttps://doi.org/10.1017/cbo9780511550850.002openalex-snapshot
Category Theory for Linear Logicians
inferred← citeshttps://doi.org/10.1017/cbo9780511550850.003openalex-snapshot
Proof Nets and the λ-Calculus
inferred← citeshttps://doi.org/10.1017/cbo9780511629150.002openalex-snapshot
Linear Logic: its syntax and semantics
inferred← citeshttps://doi.org/10.1017/cbo9781139193313.004openalex-snapshot
Generalized Proof-Nets for Compact Categories with Biproducts
inferred← citeshttps://doi.org/10.1017/s0960129500000451openalex-snapshot
The mix rule
inferred← citeshttps://doi.org/10.1017/s0960129500000797openalex-snapshot
Causal dependencies in multiplicative linear logic with MIX
inferred← citeshttps://doi.org/10.1017/s0960129500001055openalex-snapshot
! and ? – Storage as tensorial strength
inferred← citeshttps://doi.org/10.1017/s0960129500003285openalex-snapshot
Implicit exchange in multiplicative proofnets
inferred← citeshttps://doi.org/10.1017/s096012950100336xopenalex-snapshot
Locus Solum: From the rules of logic to the logic of rules
inferred← citeshttps://doi.org/10.1017/s0960129501003498openalex-snapshot
Double categories: a modular model of multiplicative linear logic
inferred← citeshttps://doi.org/10.1017/s0960129503004092openalex-snapshot
Two-dimensional proof-structures and the exchange rule
inferred← citeshttps://doi.org/10.1017/s0960129505004974openalex-snapshot
From proof-nets to bordisms: the geometric meaning of multiplicative connectives
inferred← citeshttps://doi.org/10.1017/s0960129506005652openalex-snapshot
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
inferred← citeshttps://doi.org/10.1017/s0960129507006135openalex-snapshot
A denotational semantics for the symmetric interaction combinators
inferred← citeshttps://doi.org/10.1017/s0960129507006287openalex-snapshot
On categorical models of classical logic and the Geometry of Interaction
inferred← citeshttps://doi.org/10.1017/s0960129511000582openalex-snapshot
A coding theoretic study of MLL proof nets
inferred← citeshttps://doi.org/10.1017/s0960129514000395openalex-snapshot
Proof nets and semi-star-autonomous categories
inferred← citeshttps://doi.org/10.1017/s0960129515000407openalex-snapshot
Transcendental syntax I: deterministic case
inferred← citeshttps://doi.org/10.1017/s0960129515000456openalex-snapshot
The conservation theorem for differential nets
inferred← citeshttps://doi.org/10.1017/s0960129518000300openalex-snapshot
Proof nets for multiplicative cyclic linear logic and Lambek calculus
inferred← citeshttps://doi.org/10.1017/s0960129518000385openalex-snapshot
Deep inference and expansion trees for second-order multiplicative linear logic
inferred← citeshttps://doi.org/10.1017/s096012959700234xopenalex-snapshot
A semantic characterisation of the correctness of a proof net
inferred← citeshttps://doi.org/10.1017/s096012959800262xopenalex-snapshot
Minimality of the correctness criterion for multiplicative proof nets
inferred← citeshttps://doi.org/10.1023/a:1008354130493openalex-snapshot
A New Correctness Criterion for Cyclic Proof Nets
inferred← citeshttps://doi.org/10.1023/a:1020525032763openalex-snapshot
Proof Nets for the Multimodal Lambek Calculus
inferred← citeshttps://doi.org/10.1023/b:jars.0000029976.22387.acopenalex-snapshot
A Matrix Characterization for Multiplicative Exponential Linear Logic
inferred← citeshttps://doi.org/10.1080/00107510903257624openalex-snapshot
Quantum picturalism
inferred← citeshttps://doi.org/10.1093/jigpal/jzy017openalex-snapshot
Propositional intuitionistic multiple-conclusion calculus via proof graphs
inferred← citeshttps://doi.org/10.1093/logcom/exad048openalex-snapshot
Linear logic in a refutational setting
inferred← citeshttps://doi.org/10.1093/logcom/exm089openalex-snapshot
Proof Nets for Basic Discontinuous Lambek Calculus
inferred← citeshttps://doi.org/10.1109/fscs.1990.89588openalex-snapshot
Decision problems for propositional linear logic
inferred← citeshttps://doi.org/10.1109/lics.1994.316060openalex-snapshot
Linear logic, totality and full completeness
inferred← citeshttps://doi.org/10.1109/lics.1999.782619openalex-snapshot
Full completeness of the multiplicative linear logic of Chu spaces
inferred← citeshttps://doi.org/10.1109/lics.1999.782640openalex-snapshot
Correctness of multiplicative proof nets is linear
inferred← citeshttps://doi.org/10.1109/lics.2000.855768openalex-snapshot
Dominator trees and fast verification of proof nets
inferred← citeshttps://doi.org/10.1109/lics.2003.1210039openalex-snapshot
Proof nets for unit-free multiplicative-additive linear logic (extended abstract)
inferred← citeshttps://doi.org/10.1109/lics.2004.1319612openalex-snapshot
Proof nets and Boolean circuits
inferred← citeshttps://doi.org/10.1109/lics.2004.34openalex-snapshot
Proof nets and Boolean circuits
inferred← citeshttps://doi.org/10.1109/lics.2008.20openalex-snapshot
Correctness of Multiplicative Additive Proof Structures is NL-Complete
inferred← citeshttps://doi.org/10.1109/lics.2008.35openalex-snapshot
A Neutral Approach to Proof and Refutation in MALL
inferred← citeshttps://doi.org/10.1109/lics.2010.12openalex-snapshot
Breaking Paths in Atomic Flows for Classical Logic
inferred← citeshttps://doi.org/10.1109/lics.2012.67openalex-snapshot
Constructing Fully Complete Models for Multiplicative Linear Logic
inferred← citeshttps://doi.org/10.1109/lics.2015.58openalex-snapshot
Parallelism and Synchronization in an Infinitary Context
showing the first 200 of 292 · page through all 292
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.