Relational proof system for linear and other substructural logics
From MaRDI portal
Publication:4357322
Recommendations
- Relational semantics for full linear logic
- Relational semantics and a relational proof system for full Lambek calculus
- scientific article; zbMATH DE number 7644094
- Relational semantics for a fragment of linear logic
- Modalities in linear logic weaker than the exponential ``of course: Algebraic and relational semantics
Cited in
(11)- Substructural proofs as automata
- Relational semantics for full linear logic
- scientific article; zbMATH DE number 7644094 (Why is no real title available?)
- Rasiowa-Sikorski deduction systems in computer science applications.
- scientific article; zbMATH DE number 1543335 (Why is no real title available?)
- The relational model is injective for multiplicative exponential linear logic (without weakenings)
- Correspondence results for relational proof systems with application to the Lambek calculus
- scientific article; zbMATH DE number 1501628 (Why is no real title available?)
- Theorem provers for substructural logics
- A reasoning system for satisfiability of diagrammatic specifications
- Gentzen-type calculi for involutive quantales
This page was built for publication: Relational proof system for linear and other substructural logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4357322)