Negative modal operators in intuitionistic logic.
Došen, Kosta (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Došen, Kosta (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
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.
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...
Božić, Milan (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Marković, Zoran, Ognjanović, Zoran, Rašković, Miodrag (2003)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
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...
Javier Legris, Jorge A. Molina (2001)
Philosophia Scientiae
Similarity:
In this paper we analyze the consideration of intuitionistic logic as an extension of classical logic. This — at first sight surprising — point of view has been sustained explicitly by Jan Łukasiewicz on the basis of a mapping of classical propositional logic into intuitionistic propositional logic by Kurt Gödel in 1933. Simultaneously with Gödel, Gerhard Gentzen had proposed another mapping of Peano´s arithmetic into Heyting´s arithmetic. We shall discuss these mappings in connection...
Slobodan Vujošević (2012)
Review of the National Center for Digitization
Similarity:
Taneli Huuskonen (2015)
Formalized Mathematics
Similarity:
This article is the second in a series formalizing some results in my joint work with Prof. Joanna Golinska-Pilarek ([9] and [10]) concerning a logic proposed by Prof. Andrzej Grzegorczyk ([11]). This part presents the syntax and axioms of Grzegorczyk’s Logic of Descriptions (LD) as originally proposed by him, as well as some theorems not depending on any semantic constructions. There are both some clear similarities and fundamental differences between LD and the non-Fregean logics introduced...
Guido Gherardi, Eugenio Orlandelli (2021)
Bulletin of the Section of Logic
Similarity:
This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the...
R. Kulesza (1970)
Applicationes Mathematicae
Similarity:
Dale Jacquette (2005)
Philosophia Scientiae
Similarity:
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...