Tools for the investigation of substructural and paraconsistent logics
DOI10.1007/978-3-319-11558-0_2zbMATH Open1432.68547OpenAlexW2198998891MaRDI QIDQ2938481FDOQ2938481
Authors: 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
Recommendations
- Automated support for the investigation of paraconsistent and other logics
- Analytic calculi for basic logics of formal inconsistency
- Taming paraconsistent (and other) logics: an algorithmic approach
- On the construction of analytic sequent calculi for sub-classical logics
- Current trends in substructural logics
Computer science support for mathematical research and practice (68V99) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Paraconsistent logics (03B53)
Cites Work
- The Isabelle Framework
- Standard completeness for extensions of MTL: an automated approach
- Title not available (Why is that?)
- Metamathematics of fuzzy logic
- A proof of standard completeness for Esteva and Godo's logic MTL
- Automated Support for the Investigation of Paraconsistent and Other Logics
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Title not available (Why is that?)
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Substructural fuzzy logics
- MacNeille completions of FL-algebras
- Residuated lattices. An algebraic glimpse at substructural logics
- Handbook of mathematical fuzzy logic. Volume 1
- Non-deterministic Multiple-valued Structures
- Title not available (Why is that?)
- Structural extensions of display calculi: a general recipe
- Hypersequent and labelled calculi for intermediate logics
- Logic Programming with Focusing Proofs in Linear Logic
- MUltlog 1.0: Towards an expert system for many-valued logics
- Hypersequents, logical consequence and intermediate logics for concurrency
- SAT-based decision procedure for analytic pure sequent calculi
- Finite-valued semantics for canonical labelled calculi
- An extended framework for specifying and reasoning about proof systems
- Taming Paraconsistent (and Other) Logics
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Tools for the investigation of substructural and paraconsistent logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938481)