The logic determined by Smiley's matrix for Anderson and Belnap's first-degree entailment logic
From MaRDI portal
Publication:4586153
Recommendations
Cites work
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 3926879 (Why is no real title available?)
- scientific article; zbMATH DE number 3784842 (Why is no real title available?)
- scientific article; zbMATH DE number 3496100 (Why is no real title available?)
- scientific article; zbMATH DE number 3504935 (Why is no real title available?)
- A lattice of implicative extensions of regular Kleene's logics
- An interpretation of Łukasiewicz's 4-valued modal logic
- Entailment and relevance1
- Intuitive semantics for first-degree entailments and `coupled trees'
- Partiality and its dual
- Reasoning with logical bilattices
- The non-relevant De Morgan minimal logic in Routley-Meyer semantics with no designated points
- The value of the four values
- What is strict implication?
Cited in
(5)- Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values
- Correspondence analysis and automated proof-searching for first degree entailment
- A class of implicative expansions of Belnap-Dunn logic in which Boolean negation is definable
- A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE
- EF4, EF4-M and EF4-Ł: A companion to BN4 and two modal four-valued systems without strong Łukasiewicz-type modal paradoxes
This page was built for publication: The logic determined by Smiley's matrix for Anderson and Belnap's first-degree entailment logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586153)