( en | de | ru )

 

Disambiguation of "ten Cate, Balder"

Author of the publication

copydeleteadd this publication to your clipboard
An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees.

, and . FICS, page 30-38. Institute of Cybernetics, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Abraham P ˜tenœ Cate

Robert Balder

Hartmut Balder

Balder Preuss

Balder Schäuffelen

 

Other publications of authors with the same name

Inference from Visible Information and Background Knowledge., , , , and . ACM Trans. Comput. Log., 22 (2): 13:1-13:69 (2021)Axiomatizing the Logical Core of XPath 2.0., and . ICDT, volume 4353 of Lecture Notes in Computer Science, page 134-148. Springer, (2007)Interpolation with Decidable Fixpoint Logics., , and . LICS, page 378-389. IEEE Computer Society, (2015)Lindstrom theorems for fragments of first-order logic., , and . LICS, page 280-292. IEEE Computer Society, (2007)Modal languages for topology: Expressivity and definability., , and . Ann. Pure Appl. Log., 159 (1-2): 146-170 (2009)Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees., and . LFCS, volume 5407 of Lecture Notes in Computer Science, page 180-196. Springer, (2009)On the Complexity of Hybrid Logics with Binders., and . CSL, volume 3634 of Lecture Notes in Computer Science, page 339-354. Springer, (2005)High-Level Why-Not Explanations using Ontologies., , , and . PODS, page 31-43. ACM, (2015)Beth Definability in Expressive Description Logics., , and . IJCAI, page 1099-1106. IJCAI/AAAI, (2011)On the Power and Limitations of Examples for Description Logic Concepts (Extended Abstract)., , and . Description Logics, volume 3739 of CEUR Workshop Proceedings, CEUR-WS.org, (2024)