Four-valued paradefinite logics
From MaRDI portal
Publication:1685565
DOI10.1007/s11225-017-9721-4zbMath1417.03190OpenAlexW2604370760MaRDI QIDQ1685565
Publication date: 14 December 2017
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-017-9721-4
Many-valued logic (03B50) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Paraconsistent logics (03B53)
Related Items (16)
De Morgan clones and four-valued logics ⋮ Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ Three new genuine five-valued logics intended to model non-trivial concepts ⋮ О выразительных возможностях максимально паранепротиворечивых и параполных четырехзначных расширений FDE ⋮ О выразительных возможностях отдельных расширений четырехзначной логики Белнапа ⋮ Correspondence analysis and automated proof-searching for first degree entailment ⋮ Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic ⋮ Provability multilattice logic ⋮ The normal and self-extensional extension of Dunn-Belnap logic ⋮ K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You ⋮ Modal extension of ideal paraconsistent four-valued logic and its subsystem ⋮ Paraconsistency and the need for infinite semantics ⋮ Embedding friendly first-order paradefinite and connexive logics ⋮ A Semi-lattice of Four-valued Literal-paraconsistent-paracomplete Logics ⋮ An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi ⋮ Degree-Preserving Gödel Logics with an Involution: Intermediate Logics and (Ideal) Paraconsistency
Cites Work
- Classical negation and expansions of Belnap-Dunn logic
- Maximal and premaximal paraconsistency in the framework of three-valued semantics
- Ideal paraconsistent logics
- Four valued semantics and the Liar
- Reasoning about truth
- Minimally inconsistent LP
- The value of the four values
- Four-valued semantics for relevant logics (and some of their rivals)
- Four-valued logic
- What is negation?
- On Łukasiewicz's four-valued modal logic
- Fixpoint semantics for logic programming a survey
- On negation: Pure local rules
- Intuitive semantics for first-degree entailments and `coupled trees'
- Reasoning with logical bilattices
- The logic of generalized truth values and the logic of bilattices
- A calculus of antinomics
- On the theory of inconsistent formal systems
- Non-deterministic Multiple-valued Structures
- The logic of distributive bilattices
- Processing Information from a Set of Sources
- Natural 3-valued logics—characterization and proof theory
- Bilattices and the semantics of logic programming
- The family of stable models
- Reducing Preferential Paraconsistent Reasoning to Classical Entailment
- Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond
- Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics
- On the expressive power of three-valued and four-valued languages
- Three-Valued Paraconsistent Propositional Logics
- Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Deducibility and many-valuedness
- Multi-valued Calculi for Logics Based on Non-determinism
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Four-valued paradefinite logics
