scientific article; zbMATH DE number 1841813

MaRDI QIDQ4783301zbMATH OpenFDO

Authors Alessio Guglielmi, Lutz Straßburger

Publication date 4 December 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2142/21420054

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• scientific article; zbMATH DE number 1980929
• MELL in the calculus of structures
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• A system of interaction and structure
• scientific article; zbMATH DE number 1138593

Cited in

(34)

• The calculus of multivectors on noncommutative jet spaces
• On linear logic planning and concurrency
• A deep inference system for the modal logic S5
• A logical calculus for controlled monotonicity
• Cut elimination inside a deep inference system for classical predicate logic
• On the decision problem for MELL
• The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
• A deep inference system for differential linear logic
• Exponentially handsome proof nets and their normalization
• Flag: a self-dual modality for non-commutative contraction and duplication in the category of coherence spaces
• Extension without cut
• On linear rewriting systems for Boolean logic and some applications to proof theory
• An Analytic Propositional Proof System on Graphs
• From truth to computability. I.
• MELL in the calculus of structures
• On the Power of Substitution in the Calculus of Structures
• The consistency and complexity of multiplicative additive system virtual
• A Subatomic Proof System for Decision Trees
• Computer Science Logic
• Non-associative, non-commutative multi-modal linear logic
• Deep sequent systems for modal logic
• Termination orders for three-dimensional rewriting
• Reducing Nondeterminism in the Calculus of Structures
• System NEL is undecidable
• A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
• Constructing weak simulations from linear implications for processes with private names
• Combinatorial flows as bicolored atomic flows
• Sufficient conditions for cut elimination with complexity analysis
• scientific article; zbMATH DE number 1980929 (Why is no real title available?)
• Non-crossing tree realizations of ordered degree sequences
• A propositional cirquent calculus for computability logic.
• Pomset logic. The other approach to noncommutativity in logic
• 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:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783301)