Tools for the Investigation of Substructural and Paraconsistent Logics
From MaRDI portal
Publication:2938481
DOI10.1007/978-3-319-11558-0_2zbMath1432.68547MaRDI QIDQ2938481
Agata Ciabattoni, Lara Spendier
Publication date: 14 January 2015
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_2
68V99: Computer science support for mathematical research and practice
03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
03B53: Paraconsistent logics
Related Items
Compositional meaning in logic, Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic proof theory for substructural logics: cut-elimination and completions
- MacNeille completions of FL-algebras
- Residuated lattices. An algebraic glimpse at substructural logics
- Metamathematics of fuzzy logic
- Hypersequents, logical consequence and intermediate logics for concurrency
- A proof of standard completeness for Esteva and Godo's logic MTL
- Finite-valued semantics for canonical labelled calculi
- Structural Extensions of Display Calculi: A General Recipe
- Hypersequent and Labelled Calculi for Intermediate Logics
- Standard Completeness for Extensions of MTL: An Automated Approach
- Taming Paraconsistent (and Other) Logics
- Non-deterministic Multiple-valued Structures
- SAT-Based Decision Procedure for Analytic Pure Sequent Calculi
- Automated Support for the Investigation of Paraconsistent and Other Logics
- The Isabelle Framework
- Logic Programming with Focusing Proofs in Linear Logic
- MUltlog 1.0: Towards an expert system for many-valued logics
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Substructural fuzzy logics
- An extended framework for specifying and reasoning about proof systems
