Logical definability of fixed points

DOI10.1016/0304-3975(88)90129-6zbMATH Open0663.03024OpenAlexW2009275991MaRDI QIDQ1114673FDOQ1114673

Authors: 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

Recommendations

• scientific article; zbMATH DE number 475417
• Definable fixed points in modal and temporal logics -- a survey
• scientific article; zbMATH DE number 3960988
• scientific article; zbMATH DE number 2113976
• scientific article

zbMATH Keywords

fixed pointstree automatonsystem of equationslabelled tree\(\nu \) \(\mu\)-definabilityspecial automatonBüchi set

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)

Cites Work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• Results on the propositional \(\mu\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• The greatest fixed-points and rational omega-tree languages
• Title not available (Why is that?)

Cited In (7)

• Characters and fixed points in provability logic
• Title not available (Why is that?)
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• Evidence for Fixpoint Logic
• Title not available (Why is that?)
• On modal mu-calculus and Büchi tree automata
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114673)