Correspondence analysis for strong three-valued logic


A.  Tamminga


I apply Kooi and Tamminga’s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K3). First, I characterize each possible single entry in the truth-table of a unary or a binary truth-functional operator that could be added to K3 by a basic inference scheme. Second, I define a class of natural deduction systems on the basis of these charac- terizing basic inference schemes and a natural deduction system for K3. Third, I show that each of the resulting natural deduction systems is sound and complete with respect to its particular semantics. Among other things, I thus obtain a new proof system for _ukasiewicz’s three-valued logic.






Kleene S.C. On notation for ordinal numbers // Journal of Symbolic Logic. 1938. Vol. 3. P. 150–155.
Lukasiewicz J. O logice trojwartosciowej // Ruch Filozoficzny. 1920. Vol. 5. P. 170–171. (Translated as: On three-valued logic // Jan Lukasiewicz: Selected Works / Ed. Borkowski L. Amsterdam: North Holland Publishing Company, 1970. P. 87–88).
Kooi B., Tamminga A. Completeness via correspondence for extensions of the logic of paradox // The Review of Philosophical Logic. 2012. Vol. 5. P. 720–730.
Priest G. The logic of paradox // Journal of Philosophical Logic. 1979. Vol. 8. P. 219–241.
Troelstra A.S., Schwichtenberg H. Basic Proof Theory. Cambridge: Cambridge University Press, 1996.