Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 72
Number of items: 72
  • ten Cate, B., & Fontaine, G. (2010). An easy completeness proof for the modal μ-calculus on finite trees. In R. Matthes, & T. Uustalu (Eds.), 6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings (pp. 30-38). Tallinn University of Technology, Institute of Cybernetics. http://cs.ioc.ee/fics09/fics09proc.pdf
  • ten Cate, B., Litak, T., & Marx, M. (2010). Complete axiomatizations for XPath fragments. Journal of Applied Logic, 8(2), 153-172. https://doi.org/10.1016/j.jal.2009.09.002
  • Open Access
    Gheerbrant, A. P. (2010). Fixed-point logics on trees. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Gheerbrant, A., & ten Cate, B. (2009). Craig interpolation for linear temporal languages. In E. Grädel, & R. Kahle (Eds.), Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009 : proceedings (pp. 287-301). (Lecture Notes in Computer Science; Vol. 5771). Springer. https://doi.org/10.1007/978-3-642-04027-6_22
  • Gheerbrant, A., & ten Cate, B. (2009). Complete axiomatizations of MSO, FO(TC1) and FO(LFP1) on finite trees. In S. Artemov, & A. Nerode (Eds.), Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009 : proceedings (pp. 180-196). (Lecture Notes in Computer Science; Vol. 5407). Springer. https://doi.org/10.1007/978-3-540-92687-0_13
  • Afanasiev, L., & ten Cate, B. (2009). On Core XPath with inflationary fixed points. In R. Matthes, & T. Uustalu (Eds.), Proceedings of the 6th Workshop on Fixed Points in Computer Science (FICS 2009), Coimbra, Portugal (pp. 11-17). Institute of Cybernetics at Tallinn University of Technology. http://cs.ioc.ee/fics09/fics09proc.pdf
  • ten Cate, B., & Kolaitis, P. G. (2009). Structural characterizations of schema-mapping languages. In R. Fagin (Ed.), Database Theory - ICDT 2009, 12th International Conference, Saint Petersburg, Russia (pp. 63-72). (ACM International Conference Proceedings Series; Vol. 361). ACM. https://doi.org/10.1145/1514894.1514903
  • Open Access
    ten Cate, B., & Marx, M. (2009). Axiomatizing the logical core of XPath 2.0. Theory of Computing Systems, 44(4), 561-589. https://doi.org/10.1007/s00224-008-9151-9
  • Open Access
    van Benthem, J., ten Cate, B., & Väänänen, J. (2009). Lindström theorems for fragments of first-order logic. Logical Methods in Computer Science, 5(3), Article 3. https://doi.org/10.2168/LMCS-5(3:3)2009
  • ten Cate, B., & Segoufin, L. (2008). XPath, transitive closure logic, and nested tree walking automata. In M. Lenzerini, & D. Lembo (Eds.), PODS’08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (pp. 251-260). ACM. http://doi.acm.org/10.1145/1376916.1376952
Page 3 of 8