Completeness via correspondence for extensions of the logic of paradox

Review of Symbolic Logic 5 (4):720-730 (2012)
  Copy   BIBTEX

Abstract

Taking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (LP). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to LP by an inference scheme. Second, we define a class of natural deduction systems on the basis of these characterizing inference schemes and a natural deduction system for LP. Third, we show that each of the resulting natural deduction systems is sound and complete with respect to its particular semantics.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,418

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2012-10-02

Downloads
108 (#172,125)

6 months
13 (#206,112)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Barteld Kooi
University of Groningen
Allard Tamminga
University of Greifswald