An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi
From MaRDI portal
Publication:2084568
DOI10.1007/s11787-022-00305-9OpenAlexW4283787825MaRDI QIDQ2084568
Publication date: 18 October 2022
Published in: Logica Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11787-022-00305-9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical negation and expansions of Belnap-Dunn logic
- Ideal paraconsistent logics
- Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
- A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes
- Intuitionistic logic with strong negation
- The logic of paradox
- The value of the four values
- The logic of information structures
- Informational interpretation of substructural propositional logics
- An extended first-order Belnap-Dunn logic with classical negation
- Self-extensional three-valued paraconsistent logics
- Four-valued paradefinite logics
- Handbook of philosophical logic. Vol. 6
- Intuitive semantics for first-degree entailments and `coupled trees'
- Partiality and its dual
- Reasoning with logical bilattices
- The normal and self-extensional extension of Dunn-Belnap logic
- Gentzen-type sequent calculi for extended Belnap-Dunn logics with classical negation: a general framework
- A calculus of antinomics
- A unified semantic framework for fully structural propositional sequent systems
- Constructible falsity and inexact predicates
- Self-extensional three-valued paraconsistent logics have no implication
- Three-Valued Paraconsistent Propositional Logics
- Yet another paradefinite logic: The role of conflation1
- Connexive implication
- A propositional logic with subjunctive conditionals
- Constructible falsity
- Idempotent full paraconsistent negations are not algebraizable