Modulo-counting quantifiers over finite trees

Modulo-counting quantifiers over finite trees

This paper studies logical definability of tree languages (sets of finite trees). The logical systems are consider are located between first-order logic and monadic second-order logic. We obtain results which clarify the expressive power of first-order logic extended by “modulo-counting quantifiers”...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 1994-04, Vol.126 (1), p.97-112
1. Verfasser: Potthoff, Andreas
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Language theory and syntactical analysis
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper studies logical definability of tree languages (sets of finite trees). The logical systems are consider are located between first-order logic and monadic second-order logic. We obtain results which clarify the expressive power of first-order logic extended by “modulo-counting quantifiers”.
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(94)90270-4