Switch to: References

Add citations

You must login to add citations.
  1. Cut-free sequent and tableau systems for propositional diodorean modal logics.Rajeev Goré - 1994 - Studia Logica 53 (3):433 - 457.
    We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations