Non-commutative logic. I: The multiplicative fragment
DOI10.1016/S0168-0072(99)00014-7zbMATH Open0962.03054OpenAlexW1973260109WikidataQ56391425 ScholiaQ56391425MaRDI QIDQ1964014FDOQ1964014
Authors: Paul Ruet, V. Michele Abrusci 
Publication date: 4 June 2001
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(99)00014-7
Recommendations
- Non-commutative logic II: sequent calculus and phase semantics
- scientific article; zbMATH DE number 2185722
- Non-commutative logic. III: Focusing proofs.
- Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
- Pomset logic. The other approach to noncommutativity in logic
Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cited In (42)
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- On Residuation
- On Vidal's trivalent explanations for defective conditional in mathematics
- A framework for proof systems
- A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
- Towards a semantics of proofs for non-commutative logic: Multiplicatives and additives
- A system of interaction and structure. V: The exponentials and splitting
- Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars
- Noncommutative linear logic and its quantale semantics
- Title not available (Why is that?)
- Non-commutative proof construction: a constraint-based approach
- An automated method for building cognitive models for turn-based games from a strategy logic
- Non-commutative logic. III: Focusing proofs.
- Title not available (Why is that?)
- Applying pregroups to Italian statements and questions
- Title not available (Why is that?)
- Modularity of proof-nets. Generating the type of a module.
- A mixed \(\lambda\)-calculus
- Pomset Logic
- A geometrical procedure for computing relaxation
- Linear Exponential Comonads without Symmetry
- Proof nets for multiplicative cyclic linear logic and Lambek calculus
- Connection-based proof construction in non-commutative logic
- A geometrical representation of the basic laws of categorial grammar
- A logical calculus for controlled monotonicity
- Categorial Dependency Grammars with Iterated Sequences
- Categorical proof theory of classical propositional calculus
- Non-normal modalities in variants of linear logic
- Title not available (Why is that?)
- Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing
- Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing
- Non-commutative logic II: sequent calculus and phase semantics
- Cyclic Extensions of Order Varieties
- Title not available (Why is that?)
- Non-Commutative First-Order Sequent Calculus
- Rule-Following and the Limits of Formalization: Wittgenstein’s Considerations Through the Lens of Logic
- Proof-search and proof nets in mixed linear logic
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Title not available (Why is that?)
- Permutative Additives and Exponentials
- Contrary-to-duty reasoning: a categorical approach
- Title not available (Why is that?)
This page was built for publication: Non-commutative logic. I: The multiplicative fragment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964014)
