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

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

 Authors Andrzej Pietruszczak Nicolaus Copernicus University Abstract Jaśkowski’s discussive logic D2 was formulated with the help of the modal logic S5 as follows : \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  and  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  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.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. Keywords Philosophy   Computational Linguistics   Mathematical Logic and Foundations   Logic Categories Logic and Philosophy of Logic (categorize this paper) ISBN(s) DOI 10.1007/s11225-010-9302-2 Options Edit this record Mark as duplicate Export citation  Find it on Scholar Request removal from index Revision history

## Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,687
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

## References found in this work BETA

Modal Logic: An Introduction.Brian F. Chellas - 1980 - Cambridge University Press.
Modal Logics in the Vicinity of S.Brian F. Chellas & Krister Segerberg - 1996 - Notre Dame Journal of Formal Logic 37 (1):1-24.

## Similar books and articles

Kripke Semantics for Modal Substructural Logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Normal Monomodal Logics Can Simulate All Others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.
Hereditarily Structurally Complete Modal Logics.V. V. Rybakov - 1995 - Journal of Symbolic Logic 60 (1):266-288.

## Analytics

Added to PP index
2013-09-30

Total views
20 ( #524,225 of 2,432,261 )

Recent downloads (6 months)
1 ( #466,747 of 2,432,261 )

How can I increase my downloads?

Downloads