Modulo-counting quantifiers over finite trees

DOI10.1016/0304-3975(94)90270-4zbMath0798.03007OpenAlexW4213287418MaRDI QIDQ1325850

Andreas Potthoff

Publication date: 3 November 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90270-4

zbMATH Keywords

first-order logicmonadic second-order logiclogical definability of tree languagesmodulo-counting quantifiers

Mathematics Subject Classification ID

Related Items (8)

Towards a language theory for infinite N-free pomsets. ⋮ First-order logic on finite trees ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Aperiodicity in Tree Automata ⋮ Games for Temporal Logics on Trees ⋮ Inessential features, ineliminable features, and modal logics for model theoretic syntax ⋮ Unnamed Item ⋮ Algebra for trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classifying regular events in symbolic logic
• Tree acceptors and some of their applications
• An application of games to the completeness problem for formalized theories
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• First-order properties of trees, star-free expressions, and aperiodicity
• On finite monoids having only trivial subgroups
• Generalized finite automata theory with an application to a decision problem of second-order logic
• A Note on Star-Free Events

This page was built for publication: Modulo-counting quantifiers over finite trees