Axiomatizing a Minimal Discussive Logic

Studia Logica 111 (5):855-895 (2023)
  Copy   BIBTEX

Abstract

In the paper we analyse the problem of axiomatizing the minimal variant of discussive logic denoted as D0 {\textsf {D}}_{\textsf {0}} D 0. Our aim is to give its axiomatization that would correspond to a known axiomatization of the original discussive logic D2 {\textsf {D}}_{\textsf {2}} D 2. The considered system is minimal in a class of discussive logics. It is defined similarly, as Jaśkowski’s logic D2 {\textsf {D}}_{\textsf {2}} D 2 but with the help of the deontic normal logic D\textbf{D} D. Although we focus on the smallest discussive logic and its correspondence to D2 {\textsf {D}}_{\textsf {2}} D 2, we analyse to some extent also its formal aspects, in particular its behaviour with respect to rules that hold for classical logic. In the paper we propose a deductive system for the above recalled discussive logic. While formulating this system, we apply a method of Newton da Costa and Lech Dubikajtis—a modified version of Jerzy Kotas’s method used to axiomatize D2 {\textsf {D}}_{\textsf {2}} D 2. Basically the difference manifests in the result—in the case of da Costa and Dubikajtis, the resulting axiomatization is pure modus ponens-style. In the case of D0 {\textsf {D}}_{\textsf {0}} D 0, we have to use some rules, but they are mostly needed to express some aspects of positive logic. D0 {\textsf {D}}_{\textsf {0}} D 0 understood as a set of theses is contained in D2 {\textsf {D}}_{\textsf {2}} D 2. Additionally, any non-trivial discussive logic expressed by means of Jaśkowski’s model of discussion, applied to any regular modal logic of discussion, contains D0 {\textsf {D}}_{\textsf {0}} D 0.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

External links

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

Through your library

Analytics

Added to PP
2023-05-30

Downloads
27 (#916,159)

6 months
3 (#1,170,603)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Oleg Mikhailovic Grigoriev
Moscow State University
Marek Nasieniewski
Nicolaus Copernicus University
Krystyna Mruczek-Nasieniewska
Nicolaus Copernicus University
2 more