On Three-Valued Presentations of Classical Logic

Review of Symbolic Logic:1-23 (forthcoming)
  Copy   BIBTEX

Abstract

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible.

Author Profiles

Bruno Da Re
Universidad de Buenos Aires (UBA)
Damian Szmuc
Universidad de Buenos Aires (UBA)
1 more

Analytics

Added to PP
2023-05-11

Downloads
565 (#36,387)

6 months
203 (#17,352)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?