Non-commutative proof construction: a constraint-based approach

DOI10.1016/j.apal.2006.01.002zbMath1175.03038OpenAlexW2125048030MaRDI QIDQ2503402

Jean-Marc Andreoli, Paul Ruet, Roberto Maieli

Publication date: 14 September 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2006.01.002

zbMATH Keywords

noncommutative logiccyclic linear logicproof constructionlogical sequent calculi

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Cyclic Extensions of Order Varieties

Uses Software

• Lolli

Cites Work

• Unnamed Item
• Unnamed Item
• Forum: A multiple-conclusion specification logic
• Une théorie combinatoire des séries formelles
• A proof procedure for the logic of hereditary Harrop formulas
• Logic programming in a fragment of intuitionistic linear logic
• Non-commutative logic. III: Focusing proofs.
• Focussing and proof construction
• Non-commutative logic. I: The multiplicative fragment
• Uniform proofs as a foundation for logic programming
• The Mathematics of Sentence Structure
• Quantales and (noncommutative) linear logic
• An Efficient Unification Algorithm
• A new constructive logic: classic logic
• Logic Programming with Focusing Proofs in Linear Logic
• Non-commutative logic II: sequent calculus and phase semantics