Modulo-counting quantifiers over finite trees☆

https://doi.org/10.1016/0304-3975(94)90270-4Get rights and content
Under an Elsevier user license
open archive

Abstract

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”.

Cited by (0)

☆

The present work was supported by EBRA Working Group 3166 “Algebraic and Syntactic Methods in Computer Science (ASMICS)“

Copyright © 1994 Published by Elsevier B.V.