A Kotas-Style Characterisation of Minimal Discussive Logic

Abstract

In this paper, we discuss a version of discussive logic determined by a certain variant of Jaśkowski’s original model of discussion. The obtained system can be treated as the minimal discussive logic. It is determined by frames with serial accessibility relation. As the smallest one, this logic can be treated as a basis which could be extended to richer discussive logics that are obtained by varying accessibility relation and resulting in a lattice of discussive logics. One has to remember that while formulating discussive logics there is no one-to-one determination of discussive logics by modal logics. For example, it is proved that Jaśkowski’s logic D 2 can be expressed by other than S 5 modal logics. In this paper we consider a deductive system for the sketchily described minimal logic. While formulating the deductive system, we apply a method of Kotas that was used to axiomatize D 2 . The obtained system determines a logic D 0 as a set of theses that is contained in D 2 . Moreover, any discussive logic that would be expressed by means of the provided model of discussion would contain D 0 , so it is the smallest discussive logic.

Deductive Systems in Traditional and Modern Logic

“…In [6], K. Mruczek-Nasieniewska and M. Nasieniewski analyze the so called discussive logic introduced by Stanisław Jaśkowski, and this is probably the first fully formally formulated system of paraconsistent logic. In 1974 Jerzy Kotas gave an axiomatization of discussive logic.…”