Relational proof system for linear and other substructural logics
DOI10.1093/JIGPAL/5.5.673zbMATH Open0889.03046OpenAlexW2044160264MaRDI QIDQ4357322FDOQ4357322
Authors: Wendy MacCaull
Publication date: 14 June 1998
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cf9b177ec46669fec2f57ea5f3d4f9019546e03b
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
relational semanticsKripke semanticsLambek calculusstructural rulesintuitionistic substructural logicsrelational proof systemcountermodellinear logic with exponentials
Proof theory in general (including proof-theoretic semantics) (03F03) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cited In (11)
- Theorem provers for substructural logics
- The relational model is injective for multiplicative exponential linear logic (without weakenings)
- Relational semantics for full linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rasiowa-Sikorski deduction systems in computer science applications.
- A reasoning system for satisfiability of diagrammatic specifications
- Substructural proofs as automata
- Title not available (Why is that?)
- Gentzen-type calculi for involutive quantales
- Correspondence results for relational proof systems with application to the Lambek calculus
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)