Switch to: References

Add citations

You must login to add citations.
  1. Arthur prior.B. Jack Copeland - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The logic of obligation and the obligations of the logician.A. N. Prior - 2012 - Synthese 188 (3):423-448.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)New foundations for Lewis modal systems.E. J. Lemmon - 1957 - Journal of Symbolic Logic 22 (2):176-186.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • (1 other version)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   6 citations  
  • The deducibilities of S.Jean Porte - 1981 - Journal of Philosophical Logic 10 (4):409 - 422.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The semisubstitutivity of strict implication.J. Jay Zeman - 1968 - Journal of Symbolic Logic 33 (3):462-464.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Ten modal models.Ivo Thomas - 1964 - Journal of Symbolic Logic 29 (3):125-128.
    We consider the results of adding to a basic modal system T0the axioms G1.CLpp;Pn.CLnpLn+1p; Bn.CpLnMp, where n ≧ 11, in all combinations. The method of Meredith's [7] will be extended to get models of these systems in lower predicate calculus (LPC) with a constant binary relation,U. Most of the results were already obtained in [1]–[6], though systems as in (i) and (ii) below were not investigated, except that S40in (ii) was mentioned in [1]. However some repetition may be excused in (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Lukasiewicz's symbolic logic.A. N. Prior - 1952 - Australasian Journal of Philosophy 30 (1):33 – 46.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Lemmon-style bases for the systems s1⚬ - s4⚬.J. Jay Zeman - 1968 - Journal of Symbolic Logic 33 (3):458 - 461.
    Download  
     
    Export citation  
     
    Bookmark