A criterion of fullness of many-valued systems of propositional logic
From MaRDI portal
Publication:2264754
Cited in
(9)- A sound and complete tableaux calculus for Reichenbach's quantum mechanics logic
- Representing voting rules in Łukasiewicz's three-valued logic
- Jerzy Słupecki (1904–1987)
- Generalizing functional completeness in Belnap-Dunn logic
- From paraconsistent logic to dialetheic logic
- K3, Ł3, LP, RM3, A3, FDE, M: how to make many-valued logics work for you
- 40 years of FDE: an introductory overview
- On adequate sets of multi-valued logic
- On contra-classical variants of Nelson logic \textbf{N4} and its classical extension
This page was built for publication: A criterion of fullness of many-valued systems of propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264754)