A criterion of fullness of many-valued systems of propositional logic

DOI10.1007/BF02120845MaRDI QIDQ2264754zbMATH OpenFDO

Authors Jerzy Słupecki

Publication date 1972

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02120845

Mathematics Subject Classification ID

Classical propositional logic (03B05) Many-valued logic (03B50)

Cited in

(12)

• 40 years of FDE: an introductory overview
• On adequate sets of multi-valued logic
• K3, Ł3, LP, RM3, A3, FDE, M: how to make many-valued logics work for you
• On contra-classical variants of Nelson logic \textbf{N4} and its classical extension
• Jerzy Słupecki (1904–1987)
• Generalizing functional completeness in Belnap-Dunn logic
• Representing voting rules in Łukasiewicz's three-valued logic
• From paraconsistent logic to dialetheic logic
• A sound and complete tableaux calculus for Reichenbach's quantum mechanics logic
• Ivo G. Rosenberg's work on maximal clones and minimal clones
• A note on Grigoriev and Zaitsev's system \(\mathrm{CNL}^2_4\)
• A note on the expressive completeness of LP in a metatheory without negation

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)