Displaying similar documents to “A Tableaux System in Modal Logic”

New Modification of the Subformula Property for a Modal Logic

Mitio Takano (2020)

Bulletin of the Section of Logic

Similarity:

A modified subformula property for the modal logic KD with the additionalaxiom □ ◊(A ∨ B) ⊃ □ ◊ A ∨ □ ◊B is shown. A new modification of the notion of subformula is proposed for this purpose. This modification forms a natural extension of our former one on which modified subformula property for the modal logics K5, K5D and S4.2 has been shown ([2] and [4]). The finite model property as well as decidability for the logic follows from this.

Deontic Paradoxes and Tableau System for Kalinowski’s Deontic Logic K1

Janusz Ciuciura (2017)

Bulletin of the Section of Logic

Similarity:

In 1953, Jerzy Kalinowski published his paper on the logic of normative sentences. The paper is recognized as one of the first publications on the formal system of deontic logic. The aim of this paper is to present a tableau system for Kalinowski’s deontic logic and to discuss some of the topics related to the paradoxes of deontic logic.

On Theses Without Iterated Modalities of Modal Logics Between C1 and S5. Part 1

Andrzej Pietruszczak (2017)

Bulletin of the Section of Logic

Similarity:

This is the first, out of two papers, in which we identify all logics between C1 and S5 having the same theses without iterated modalities. All these logics canbe divided into certain groups. Each such group depends only on which of thefollowing formulas are theses of all logics from this group: (N), (T), (D), ⌜(T)∨ ☐q⌝,and for any n > 0 a formula ⌜(T) ∨ (altn)⌝, where (T) has not the atom ‘q’, and(T) and (altn) have no common atom. We generalize Pollack’s result from [12],where he...

On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2

Andrzej Pietruszczak (2017)

Bulletin of the Section of Logic

Similarity:

This is the second, out of two papers, in which we identify all logics between C1 and S5 having the same theses without iterated modalities. All these logics can be divided into certain groups. Each such group depends only on which of the following formulas are theses of all logics from this group: (N), (T), (D), ⌜(T)∨☐q⌝, and for any n > 0 a formula ⌜(T) ∨ (altn)⌝, where (T) has not the atom ‘q’, and (T) and (altn) have no common atom. We generalize Pollack’s result from [1], where...

From Intuitionism to Brouwer's Modal Logic

Zofia Kostrzycka (2020)

Bulletin of the Section of Logic

Similarity:

We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication, whereas variables and other positive sentences remain as they are. The proposed translation preserves fragments of the Rieger-Nishimura lattice which is the Lindenbaum algebra of monadic formulas in INT. Unfortunately, INT is not embedded...

A Modified Subformula Property for the Modal Logic S4.2

Mitio Takano (2019)

Bulletin of the Section of Logic

Similarity:

The modal logic S4.2 is S4 with the additional axiom ◊□A ⊃ □◊A. In this article, the sequent calculus GS4.2 for this logic is presented, and by imposing an appropriate restriction on the application of the cut-rule, it is shown that, every GS4.2-provable sequent S has a GS4.2-proof such that every formula occurring in it is either a subformula of some formula in S, or the formula □¬□B or ¬□B, where □B occurs in the scope of some occurrence of □ in some formula of S. These are just the...

Logics that are both paraconsistent and paracomplete

Newton C.A. da Costa (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

The Author describes new systems of logic (called "nonalethic") which are both paraconsistent and paracomplete. These systems are connected with the logic of vagueness and with certain philosophical problems (e.g. with some aspects of Hegel's logic).