Switch to: Citations

Add references

You must login to add references.
  1. A Method of Generating Modal Logics Defining Jaśkowski’s Discussive Logic D2.Marek Nasieniewski & Andrzej Pietruszczak - 2011 - Studia Logica 97 (1):161-182.
    Jaśkowski’s discussive logic D2 was formulated with the help of the modal logic S5 as follows (see [7, 8]): \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} = (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Simplified Kripke style semantics for some very weak modal logics.Andrzej Pietruszczak - 2009 - Logic and Logical Philosophy 18 (3-4):271-296.
    In the present paper we examine very weak modal logics C1, D1, E1, S0.5◦, S0.5◦+(D), S0.5 and some of their versions which are closed under replacement of tautological equivalents (rte-versions). We give semantics for these logics, formulated by means of Kripke style models of the form , where w is a «distinguished» world, A is a set of worlds which are alternatives to w, and V is a valuation which for formulae and worlds assigns the truth-vales such that: (i) for (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On Theses Without Iterated Modalities of Modal Logics Between C1 and S5. Part 1.Andrzej Pietruszczak - 2017 - Bulletin of the Section of Logic 46 (1/2).
    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:,,, ⌜∨ ☐q⌝,and for any n > 0 a formula ⌜ ∨ ⌝, where has not the atom ‘q’, and and have no common atom. We generalize Pollack’s result from [12],where (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2.Andrzej Pietruszczak - 2017 - Bulletin of the Section of Logic 46 (3/4).
    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:,,, ⌜∨☐q⌝, and for any n > 0 a formula ⌜ ∨ ⌝, where has not the atom ‘q’, and and have no common atom. We generalize Pollack’s result (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Method of Generating Modal Logics Defining Jaśkowski’s Discussive Logic D2.Marek Nasieniewski & Andrzej Pietruszczak - 2011 - Studia Logica 97 (1):161-182.
    Jaśkowski’s discussive logic D2 was formulated with the help of the modal logic S5 as follows (see [7, 8]): \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} = (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The decidability of normal k5 logics.Michael C. Nagle - 1981 - Journal of Symbolic Logic 46 (2):319-328.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Simplified Kripke style semantics for modal logics K45, KB4 and KD45.Andrzej Pietruszczak - 2009 - Bulletin of the Section of Logic 38 (3/4):163-171.
    Download  
     
    Export citation  
     
    Bookmark   4 citations