Correspondence analysis for strong three-valued logic

Logical Investigations 20:255-268 (2014)
  Copy   BIBTEX


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 characterizing 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 Lukasiewicz's three-valued logic.



External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A natural deduction system for first degree entailment.Allard M. Tamminga & Koji Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (2):258-272.
Three-valued logics in modal logic.Barteld Kooi & Allard Tamminga - 2013 - Studia Logica 101 (5):1061-1072.
How to avoid deviance (in logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Partiality and its dual.J. Michael Dunn - 2000 - Studia Logica 66 (1):5-40.
Finiteness in infinite-valued łukasiewicz logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.


Added to PP

196 (#101,735)

6 months
85 (#55,147)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Allard Tamminga
University of Greifswald

References found in this work

On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.

Add more references