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 can be expressed by other than 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 . The obtained system determines a logic as a set of theses that is contained in . Moreover, any discussive logic that would be expressed by means of the provided model of discussion would contain , so it is the smallest discussive logic.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited