Computer-Aided Searching for a Tabular Many-Valued Discussive Logic—Matrices

Logic Journal of the IGPL (forthcoming)
  Copy   BIBTEX

Abstract

In the paper, we tackle the matter of non-classical logics, in particular, paraconsistent ones, for which not every formula follows in general from inconsistent premisses. Our benchmark is Jaśkowski’s logic, modeled with the help of discussion. The second key origin of this paper is the matter of being tabular, i.e. being adequately expressible by finitely many finite matrices. We analyse Jaśkowski’s non-tabular discussive (discursive) logic $ \textbf {D}_{2}$, one of the first paraconsistent logics, from the perspective of a trivalent tabular logic. We are motivated to step down from the ongoing modal $ \textbf {S5}$-perspective of developing $ \textbf {D}_{2}$ both by certain mysteries that have been surrounding it and by gaps in Jaśkowski’s arguments contra the multivalent tabular perspective. Although Jaśkowski’s idea to use $ \textbf {S5}$ in order to define $ \textbf {D}_{2}$ is very attractive since it allows one to benefit from the tools and results of modal logic, it also gives a ‘non-direct’ formulation and, as it appeared later, is superfluous with respect to what is meant to be achieved since one can define the very same logic but using modal logics weaker than S5. It is also known, due to Kotas, that discussive logic is not finite-valued. So, in light of Kotas’s result that $ \textbf {D}_{2}$ is non-tabular, we propose to associate it with a few dozen discussive formulae that Jaśkowski unequivocally and illustratively suggests to be its theorems or non-theorems rather than with axioms of its modern axiomatizations (one of which Kotas employs) in order to be capable of performing a computer-aided brute-force search for suitable trivalent matrices in the cases of one and two designated values. As a result, we find trivalent matrices with two designated values that might be dubbed ‘discussive’ because they meet Jaśkowski’s suggestion to validate and invalidate the litmus theorems and non-theorems, respectively, despite the fact that none of them validates all the negation axioms in the modern axiomatizations of $ \textbf {D}_{2}$. The matrices found are then analysed along with highlighting the ones that were previously mentioned in the literature. We conclude the paper with a comparative analysis of Omori’s results and a test of Karpenko’s hypothesis.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

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

Through your library

Similar books and articles

An Adaptive Logic Based on Jaśkowskiˈs Approach to Paraconsistency.Joke Meheus* - 2006 - Journal of Philosophical Logic 35 (6):539-567.
The Logic of Pragmatic Truth.Newton C. A. Da Costa, Otávio Bueno & Steven French - 1998 - Journal of Philosophical Logic 27 (6):603-620.

Analytics

Added to PP
2024-06-10

Downloads
5 (#847,061)

6 months
5 (#1,552,255)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Marek Nasieniewski
Nicolaus Copernicus University
Yaroslav Petrukhin
Moscow State University
Vasily Olegovich Shangin
Moscow State University

Citations of this work

No citations found.

Add more citations

References found in this work

On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.
The propositional logic of ordinary discourse.William S. Cooper - 1968 - Inquiry: An Interdisciplinary Journal of Philosophy 11 (1-4):295 – 320.

View all 26 references / Add more references