Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA.Willem Conradie, Valentin Goranko & Dimitar Vakarelov - 2010 - Journal of Applied Logic 8 (4):319-333.
    The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we prove that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal and temporal extensions of non-distributive propositional logics.Chrysafis Hartonas - 2016 - Logic Journal of the IGPL 24 (2):156-185.
    Download  
     
    Export citation  
     
    Bookmark   11 citations