In Jaśkowski’s model of discussion, discussive connectives represent certain interactions that can hold between debaters. However, it is not possible within the model for participants to use explicit modal operators. In the paper we present a modal extension of the discussive logic $\textbf{D}_{\textbf{2}}$ that formally corresponds to an extended version of Jaśkowski’s model of discussion that permits such a use. This logic is denoted by $\textbf{m}\textbf{D}_{\textbf{2}}$. We present philosophical motivations for the formulation of this logic. We also give syntactic characterizations of the logic and propose a comparison with certain other modal systems. In particular, we prove that $\textbf{m}\textbf{D}_{\textbf{2}}$ is neither normal nor regular. On the basis of the axiomatization of $\textbf{D}_{\textbf{2}}$, we give an axiomatization of $\textbf{m}\textbf{D}_{\textbf{2}}$. We also give another axiomatization which is not based on the axiomatization of $\textbf{D}_{\textbf{2}}$. Furthermore, we give a natural Kripke-style semantics for $\textbf{m}\textbf{D}_{\textbf{2}}$ and prove the respective adequacy theorems.
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.
In Béziau (Log Log Philos 15:99–111, 2006 ) a logic \(\mathbf {Z}\) was defined with the help of the modal logic \(\mathbf {S5}\). In it, the negation operator is understood as meaning ‘it is not necessary that’. The strong soundness–completeness result for \(\mathbf {Z}\) with respect to a version of Kripke semantics was also given there. Following the formulation of \(\mathbf {Z}\) we can talk about \(\mathbf {Z}\)-like logics or Beziau-style logics if we consider other modal logics instead of \(\mathbf {S5}\)—such a possibility has been mentioned in [ 1 ]. The correspondence result between modal logics and respective Beziau-style logics has been generalised for the case of normal logics naturally leading to soundness–completeness results [see Marcos (Log Anal 48(189–192):279–300, 2005 ) and Mruczek-Nasieniewska and Nasieniewski (Bull Sect Log 34(4):229–248, 2005 )]. In Mruczek-Nasieniewska and Nasieniewski (Bull Sect Log 37(3–4):185–196, 2008 ), (Bull Sect Log 38(3–4):189–203, 2009 ) some partial results for non-normal cases are given. In the present paper we try to give similar but more general correspondence results for the non-normal-worlds case. To achieve this aim we have to enrich original Beziau’s language with an additional negation operator understood as ‘it is necessary that not’.
Let τ : F → N be a type of a variety V . Every partition P of the set F determines a so-called P-compatible variety. We consider the varieties GnP defined by so-called P-compatible identities of Abelian groups with exponent n. Besides, we study a connection between the lattice of all partitions of the set F and the lattice of all subvarieties of the variety defined by some kind of P-compatible identities — externally compatible identities satisfied in the class of all Abelian groups with exponent n.
In [1] J.-Y. Bèziau formulated a logic called Z. Bèziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been shown in [6] and [7] that there is a correspondence between normal modal logics and logics from the class K. Similar; but only partial results has been obtained also for regular logics (see [8] and [9]). In (Došen; [2]) a logic N has been investigated in the language with negation; implication; conjunction and disjunction by axioms of positive intuitionistic logic; the right-to-left part of the second de Morgan law; and the rules of modus ponens and contraposition. From the semantical point of view the negation used by Došen is the modal operator of impossibility. It is known this operator is a characteristic of the modal interpretation of intuitionistic negation (see [3; p. 300]). In the present paper we consider an extension of N denoted by N+. We will prove that every extension of N+ that is closed under the same rules as N+; corresponds to a regular logic being an extension of the regular deontic logic D21 (see [4] and [13]). The proved correspondence allows to obtain from soundnesscompleteness result for any given regular logic containing D2, similar adequacy theorem for the respective extension of the logic N+.