Logical definability of fixed points

DOI10.1016/0304-3975(88)90129-6zbMath0663.03024OpenAlexW2009275991MaRDI QIDQ1114673

André Arnold

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90129-6

zbMATH Keywords

fixed pointstree automatonsystem of equationslabelled tree\(\nu \) \(\mu\)-definabilityBüchi setspecial automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic structures (08A99) Inductive definability (03D70)

Related Items (2)

On modal mu-calculus and Büchi tree automata ⋮ Theμ-calculus alternation-depth hierarchy is strict on binary trees

Cites Work

• Results on the propositional \(\mu\)-calculus
• The greatest fixed-points and rational omega-tree languages
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logical definability of fixed points