Tools for the investigation of substructural and paraconsistent logics
From MaRDI portal
Publication:2938481
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
Cites work
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 2019859 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 877750 (Why is no real title available?)
- A proof of standard completeness for Esteva and Godo's logic MTL
- Algebraic proof theory for substructural logics: cut-elimination and completions
- An extended framework for specifying and reasoning about proof systems
- Automated support for the investigation of paraconsistent and other logics
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Finite-valued semantics for canonical labelled calculi
- Handbook of mathematical fuzzy logic. Volume 1
- Hypersequent and labelled calculi for intermediate logics
- Hypersequents, logical consequence and intermediate logics for concurrency
- Logic Programming with Focusing Proofs in Linear Logic
- MUltlog 1.0: towards an expert system for many-valued logics
- MacNeille completions of FL-algebras
- Metamathematics of fuzzy logic
- Non-deterministic Multiple-valued Structures
- Residuated lattices. An algebraic glimpse at substructural logics
- SAT-based decision procedure for analytic pure sequent calculi
- Standard completeness for extensions of MTL: an automated approach
- Structural extensions of display calculi: a general recipe
- Substructural fuzzy logics
- Taming paraconsistent (and other) logics: an algorithmic approach
- The Isabelle Framework
Cited in
(7)- Gen2sat: an automated tool for deciding derivability in analytic pure sequent calculi
- On the construction of analytic sequent calculi for sub-classical logics
- scientific article; zbMATH DE number 2019874 (Why is no real title available?)
- Compositional meaning in logic
- Automated support for the investigation of paraconsistent and other logics
- Sub-classical Boolean Bunched Logics and the Meaning of Par
- Taming paraconsistent (and other) logics: an algorithmic approach
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)