Tableaux and restricted quantification for systems related to weak Kleene logic
From MaRDI portal
Publication:2142060
Cites work
- An embedding-based completeness proof for Nelson's paraconsistent logic
- Angellic content
- Faulty Belnap computers and subsystems of FDE
- Formal inconsistency and evolutionary databases
- Grounding and truth-functions
- scientific article; zbMATH DE number 3139759 (Why is no real title available?)
- scientific article; zbMATH DE number 2101974 (Why is no real title available?)
- scientific article; zbMATH DE number 3032489 (Why is no real title available?)
- scientific article; zbMATH DE number 3061149 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Immune logics
- Logics and falsifications. A new perspective on constructivist semantics
- Structural proof theory for first-order weak Kleene logics
- Systematization of finite many-valued logics through the method of tableaux
Cited in
(5)- Tableau method and NEXPTIME-completeness of DEL-sequents
- scientific article; zbMATH DE number 6316278 (Why is no real title available?)
- Tableau Systems for Logics of Subinterval Structures over Dense Orderings
- Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC
- Tableaux for metainferential logics
This page was built for publication: Tableaux and restricted quantification for systems related to weak Kleene logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2142060)