We provide an algebraic characterization of the expressive power of various naturally defined logics on finite trees. These logics are described in terms of Lindström quantifiers, and particular cases include first-order logic and modular logic. The algebraic characterization we give is expressed in terms of a new algebraic structure, finitary preclones, and uses a generalization of the block product operation. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Ésik, Z., & Weil, P. (2003). On logically defined recognizable tree languages. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2914, 195–207. https://doi.org/10.1007/978-3-540-24597-1_17
Mendeley helps you to discover research relevant for your work.