Switch to: References

Add citations

You must login to add citations.
  1. Finite models constructed from canonical formulas.Lawrence S. Moss - 2007 - Journal of Philosophical Logic 36 (6):605 - 640.
    This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229-237, 1975). There are two ways in which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113-118, 1981). The point is to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • Coalgebraic logic.Lawrence S. Moss - 1999 - Annals of Pure and Applied Logic 96 (1-3):277-317.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  • On the Modal Definability of Simulability by Finite Transitive Models.David Fernández Duque - 2011 - Studia Logica 98 (3):347-373.
    We show that given a finite, transitive and reflexive Kripke model 〈 W , ≼, ⟦ ⋅ ⟧ 〉 and $${w \in W}$$ , the property of being simulated by w (i.e., lying on the image of a literalpreserving relation satisfying the ‘forth’ condition of bisimulation) is modally undefinable within the class of S4 Kripke models. Note the contrast to the fact that lying in the image of w under a bi simulation is definable in the standard modal language even (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations