An embedding-based completeness proof for Nelson's paraconsistent logic
From MaRDI portal
Recommendations
Cited in
(16)- Embedding friendly first-order paradefinite and connexive logics
- Tableaux and restricted quantification for systems related to weak Kleene logic
- Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic
- A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics
- Notes on Craig interpolation for LJ with strong negation
- Displaying the modal logic of consistency
- On the equivalence of paraconsistent and explosive versions of Nelson logic
- Transfer theorems for extensions of the paraconsistent Nelson logic
- Executability and connexivity in an interpretation of Griss
- Nelsonian counterparts of Visser's logics
- Falsification-aware calculi and semantics for normal modal logics including S4 and S5
- Consistency-sensitive epistemic modalities in information-based semantics
- Generalized Kripke semantics for Nelson's logic
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
- Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
- Unification problem in Nelson's logic \(\mathbf{N4}\)
This page was built for publication: An embedding-based completeness proof for Nelson's paraconsistent logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411482)
