Proof theory of Nelson's paraconsistent logic: a uniform perspective
From MaRDI portal
Publication:764309
DOI10.1016/J.TCS.2011.11.001zbMATH Open1382.03048OpenAlexW2054776590MaRDI QIDQ764309FDOQ764309
Authors: Norihiro Kamide, Heinrich Wansing 
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.001
Recommendations
- Nelson's paraconsistent logics
- An embedding-based completeness proof for Nelson's paraconsistent logic
- The class of extensions of Nelson's paraconsistent logic
- scientific article; zbMATH DE number 6407640
- Natural deduction systems for Nelson's paraconsistent logic and its neighbors
- On the equivalence of paraconsistent and explosive versions of Nelson logic
- Algebraic Semantics for Paraconsistent Nelson's Logic
- A uniform proof-theoretic foundation for abstract paraconsistent logic programming
- Priestley duality for paraconsistent Nelson's logic
- scientific article; zbMATH DE number 2209330
paraconsistent logicsequent calculicut eliminationnormalizationinconsistency-tolerant reasoningnatural deduction systemsNelson's paraconsistent logic N4
Cites Work
- Paraconsistent logic programming
- The power of Belnap: sequent systems for \(SIXTEEN_{3 }\)
- Structural proof theory. With an appendix by Aarne Ranta
- Intuitionistic Trilattice Logics
- SEQUENT CALCULI FOR SOME TRILATTICE LOGICS
- Title not available (Why is that?)
- Some useful 16-valued logics: How a computer network should think
- The logic of information structures
- Dual-intuitionistic logic
- Display logic
- On the theory of inconsistent formal systems
- The Logic of Contradiction
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Trilattice of Constructive Truth Values
- Title not available (Why is that?)
- Constructible falsity
- Subtractive logic
- Limits for paraconsistent calculi
- Dual intuitionistic logic and a variety of negations: the logic of scientific research
- Intuitive semantics for first-degree entailments and `coupled trees'
- Title not available (Why is that?)
- A non-deterministic view on non-classical negations
- The value of the four values
- A formalization of the propositional calculus of H-B logic
- Reasoning with logical bilattices
- Constructive negation, implication, and co-implication
- Bilattices and the semantics of logic programming
- Logic programming and negation: A survey
- Belnap's Four-Valued Logic and De Morgan Lattices
- Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond
- Constructive negations and paraconsistency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On logics with coimplication
- Constructible falsity and inexact predicates
- Partiality and its dual
- Title not available (Why is that?)
- Admissibility of structural rules for contraction-free systems of intuitionistic logic
- Handbook of philosophical logic. Vol. 6
- Combining linear-time temporal logic with constructiveness and paraconsistency
- Intuitionistic logic with strong negation
- Informational interpretation of substructural propositional logics
- Title not available (Why is that?)
- A semantical study of constructible falsity
- A remark on Gentzen's calculus of sequents
- Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents
- Hyper-contradictions, generalized truth values and logics of truth and falsehood
- Propositional sequence-calculi for inconsistent systems
- Sequent calculus in natural deduction style
- A Paraconsistent Linear-time Temporal Logic
- Characterizing Belnap's Logic via De Morgan's Laws
- A note on dual-intuitionistic logic
- Title not available (Why is that?)
- Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)
- Semantical analyses of propositional systems of Fitch and Nelson
- Paraconsistent declarative semantics for extended logic programs
- Symmetric and dual paraconsistent logics
- Automating and computing paraconsistent reasoning: contraction-free, resolution and type systems
- Natural deduction systems for Nelson's paraconsistent logic and its neighbors
- Logic Programming with Strong Negation and Inexact Predicates
- Title not available (Why is that?)
- Title not available (Why is that?)
- A deductive-reductive form of logic: Intuitionistic S4 modalities
- An embedding-based completeness proof for Nelson's paraconsistent logic
- A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
- Sixty Years of Stable Models
- Title not available (Why is that?)
- A natural deduction system for first degree entailment
Cited In (37)
- Paraconsistent double negation as a modal operator
- Gentzen-type sequent calculi for extended Belnap-Dunn logics with classical negation: a general framework
- An invitation to new essays on Belnap-Dunn logic
- Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
- Strong negation in intuitionistic style sequent systems for residuated lattices
- Negative modalities in the light of paraconsistency
- Prawitz, Proofs, and Meaning
- Natural deduction systems for Nelson's paraconsistent logic and its neighbors
- A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics
- Inconsistency-tolerant temporal reasoning with hierarchical information
- On split negation, strong negation, information, falsification, and verification
- Nelson's paraconsistent logics
- Falsification-aware calculi and semantics for normal modal logics including S4 and S5
- Classical negation and expansions of Belnap-Dunn logic
- Inconsistency-tolerant multi-agent calculus
- Paraconsistent logic, evidence, and justification
- Algebraic Semantics for Paraconsistent Nelson's Logic
- Title not available (Why is that?)
- Rules of explosion and excluded middle: constructing a unified single-succedent Gentzen-style framework for classical, paradefinite, paraconsistent, and paracomplete logics
- An infinity of intuitionistic connexive logics
- A note on synonymy in proof-theoretic semantics
- Title not available (Why is that?)
- Transfer theorems for extensions of the paraconsistent Nelson logic
- Logical multilateralism
- On Synonymy in Proof-Theoretic Semantics: The Case of \(\mathtt{2Int}\)
- From paraconsistent logic to dialetheic logic
- Nelson algebras, residuated lattices and rough sets: A survey
- Conservative translations revisited
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic
- On contra-classical variants of Nelson logic \textbf{N4} and its classical extension
- A uniform proof-theoretic foundation for abstract paraconsistent logic programming
- Automating and computing paraconsistent reasoning: contraction-free, resolution and type systems
- An embedding-based completeness proof for Nelson's paraconsistent logic
- Falsification-aware semantics and sequent calculi for classical logic
- Embedding friendly first-order paradefinite and connexive logics
- Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
Uses Software
This page was built for publication: Proof theory of Nelson's paraconsistent logic: a uniform perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764309)
