Answers are grounded in this paper and cite their sources.
In this paper natural deduction systems for four-valued logic $FDE$ (first degree entailment) and its extensions are constructed. At that B. Kooi and A. Tamminga’s method of correspondence analysis is used. All possible four-valued unary and binary ∘ propositional connectives which could be added to $FDE$ are considered. Then $FDE$ is extended by Boolean negation ~and every entry (line) of truth tables for and ∘is characterized by inference scheme. By adding all inference schemes characterizing truth tables for and ∘as rules of inference to the natural deduction for $FDE$, natural deduction for extension of $FDE$ is obtained. In addition, applying of correspondence analysis gives axiomatizations of implicative extensions of $FDE$ including $BN4$ and some extensions by classical implications.
No takes yet. Share an insight, caveat, or question.
Я. И. Петрухин (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: