Abstract

We construct a countable family of extensions of the logic of finite chains (the Dummett logic) in the language containing the standard logical connectives and a new connective (irreflexive modality), each of which determines in the Dummett logic a new logical connective in the sense of Novikov. Two arbitrary logics on this list are incompatible over the Dummett logic; i.e., their union contains a formula absent from the Dummett logic.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call