Interpolation Methods for Dunn Logics and Their Extensions

Stefan Wintein, Reinhard Muskens

Research output: Contribution to journalArticleScientificpeer-review

1 Downloads (Pure)

Abstract

The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the Dunncalculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In terms of the Dunn calculus, we first introduce two different interpolation methods, each of which uniformly shows that the Dunn logics have the interpolation property. One of the methods is closely related to Maehara’s method but the other method, which we call the pruned tableau method, is novel to this paper. We provide various reasons to prefer the pruned tableau method to the Maehara-style method. We then turn our attention to extensions of Dunn logics with so-called appropriate implication connectives. Although these logics have been considered at various places in the literature, a study of the interpolation properties of these logics is lacking. We use the pruned tableau method to uniformly show that these extended Dunn logics have the interpolation property and explain that the same result cannot be obtained via the Maehara-style method. Finally, we show how the pruned tableau method constructs interpolants for functionally complete extensions of the Dunn logics.
Original languageEnglish
Pages (from-to)1319–1347
JournalStudia Logica
Volume105
Issue number6
DOIs
Publication statusPublished - 2017

    Fingerprint

Keywords

  • Interpolation methods
  • Dunn logics
  • First degree entailment
  • Logic of paradox
  • Strong Kleene logic
  • Tableau calculus

Cite this