Switch to: References

Add citations

You must login to add citations.
  1. Some modal aspects of XPath.Balder ten Cate, Gaëlle Fontaine & Tadeusz Litak - 2010 - Journal of Applied Non-Classical Logics 20 (3):139-171.
    This paper provides several examples of how modal logic can be used in studying the XML document navigation language XPath. More specifically, we derive complete axiomatizations, computational complexity and expressive power results for XPath fragments from known results for corresponding logics. A secondary aim of the paper is to introduce XPath in a way that makes it accessible to an audience of modal logicians.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Complete axiomatizations for XPath fragments.Balder ten Cate, Tadeusz Litak & Maarten Marx - 2010 - Journal of Applied Logic 8 (2):153-172.
  • Subdirectly irreducible separable dynamic algebras.Sandra Marques Pinto & M. Teresa Oliveira-Martins - 2010 - Mathematical Logic Quarterly 56 (4):442-448.
    A characterization of the subdirectly irreducible separable dynamic algebras is presented. The notions develo- ped for this study were also suitable to describe the previously found class of simple separable dynamic algebras.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • PDL has interpolation.Tomasz Kowalski - 2002 - Journal of Symbolic Logic 67 (3):933-946.
    It is proved that free dynamic algebras superamalgamate. Craig interpolation for propositional dynamic logic and superamalgamation for the variety of dynamic algebras follow.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A proof system for contact relation algebras.Ivo Düntsch & Ewa Orłowska - 2000 - Journal of Philosophical Logic 29 (3):241-262.
    Contact relations have been studied in the context of qualitative geometry and physics since the early 1920s, and have recently received attention in qualitative spatial reasoning. In this paper, we present a sound and complete proof system in the style of Rasiowa and Sikorski (1963) for relation algebras generated by a contact relation.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Complexity of equations valid in algebras of relations part I: Strong non-finitizability.Hajnal Andréka - 1997 - Annals of Pure and Applied Logic 89 (2):149-209.
    We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   23 citations