11 found
Sort by:
Disambiguations:
Balder ten Cate [9]Blader Ten Cate [1]B. ten Cate [1]
  1. Balder ten Cate & Jan van Eijck, Expressivity of Extensions of Dynamic First-Order Logic.
    Dynamic predicate logic (DPL), presented in [5] as a formalism for representing anaphoric linking in natural language, can be viewed as a fragment of a well known formalism for reasoning about imperative programming [6]. An interesting difference from other forms of dynamic logic is that the distinction between formulas and programs gets dropped: DPL formulas can be viewed as programs. In this paper we show that DPL is in fact the basis of a hierarchy of formulas-as-programs languages.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Balder ten Cate & Jan van Eijck, Expressivity of Extensions of Dynamic First-Order Logic.
    Dynamic predicate logic (DPL), presented in [5] as a formalism for representing anaphoric linking in natural language, can be viewed as a fragment of a well known formalism for reasoning about imperative programming [6]. An interesting difference from other forms of dynamic logic is that the distinction between formulas and programs gets dropped: DPL formulas can be viewed as programs. In this paper we show that DPL is in fact the basis of a hierarchy of formulas-as-programs languages.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  3. Balder ten Cate, Gaëlle Fontaine & Tadeusz Litak (2010). Some Modal Aspects of XPath. Journal of Applied Non-Classical Logics 20 (3):139-171.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Blader Ten Cate, Luis Farinas Del Cero & Andreas Herzig (2010). Some Modal Aspects of XPath. Journal of Applied Non-Classical Logics 20 (3):139-171.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Balder Ten Cate, David Gabelaia & Dmitry Sustretov (2009). Modal Languages for Topology: Expressivity and Definability. Annals of Pure and Applied Logic 159 (1):146-170.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. Patrick Blackburn & Balder Ten Cate (2006). Pure Extensions, Proof Rules, and Hybrid Axiomatics. Studia Logica 84 (2):277-322.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Balder ten Cate (2006). Expressivity of Second Order Propositional Modal Logic. Journal of Philosophical Logic 35 (2):209-223.
    We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order logic and SOPML.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  8. J. van Benthem, G. Bezhanishvili, B. ten Cate & D. Sarenac (2006). Mr2290114 (2007i: 03026) 03b45. Studia Logica 84 (3):369-392.
    No categories
     
    My bibliography  
     
    Export citation  
  9. Johan van Benthem, Guram Bezhanishvili, Balder ten Cate & Darko Sarenac (2006). Multimo Dal Logics of Products of Topologies. Studia Logica 84 (3):369-392.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. Balder ten Cate (2005). Interpolation for Extended Modal Languages. Journal of Symbolic Logic 70 (1):223-234.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Balder ten Cate & Massimo Franceschet (2005). Guarded Fragments with Constants. Journal of Logic 14 (3):281-288.
    We prove ExpTime-membership of the satisfiability problem for loosely ∀-guarded first-order formulas with a bounded number of variables and an unbounded number of constants. Guarded fragments with constants are interesting by themselves and because of their connection to hybrid logic.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation