Correspondence analysis for strong three-valued logic

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.