On logically defined recognizable tree languages

Zoltán Ésik, Pascal Weil

Research output: Article

17 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)195-207
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2914
Publication statusPublished - dec. 1 2003

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this