# A Method of Generating Modal Logics Defining Jaśkowski’s Discussive Logic D2

Studia Logica 97 (1):161-182 (2011)

# Abstract

Jaśkowski’s discussive logic D2 was formulated with the help of the modal logic S5 as follows (see [7, 8]): \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${A \in {D_{2}}}$$\end{document} iff \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\rm S}5}$$\end{document}, where (–)• is a translation of discussive formulae from Ford into the modal language. We say that a modal logic L defines D2 iff \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm D}_{2} = \{A \in {\rm For^{\rm d}} : \ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\it L}\}}$$\end{document}. In [14] and [10] were respectively presented the weakest normal and the weakest regular logic which (†): have the same theses beginning with ‘\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\diamond}$$\end{document}’ as S5. Of course, all logics fulfilling the above condition, define D2. In [10] it was prowed that in the cases of logics closed under congruence the following holds: defining D2 is equivalent to having the property (†). In this paper we show that this equivalence holds also for all modal logics which are closed under replacement of tautological equivalents (rte-logics).We give a general method which, for any class of modal logics determined by a set of joint axioms and rules, generates in the given class the weakest logic having the property (†). Thus, for the class of all modal logics we obtain the weakest modal logic which owns this property. On the other hand, applying the method to various classes of modal logics: rte-logics, congruential, monotonic, regular and normal, we obtain the weakest in a given class logic defining D2.

## PhilArchive

Upload a copy of this work     Papers currently archived: 94,659

Setup an account with your affiliations in order to access resources via your University's proxy server

# Similar books and articles

Two-cardinal diamond and games of uncountable length.Pierre Matet - 2015 - Archive for Mathematical Logic 54 (3-4):395-412.
Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.

2013-09-30

39 (#405,846)

6 months
16 (#219,310)