Logical definability of fixed points (Q1114673): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q593584 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Boleslaw Wojdyło / rank | |||
Normal rank | |||
Revision as of 01:02, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Logical definability of fixed points |
scientific article |
Statements
Logical definability of fixed points (English)
0 references
1988
0 references
A class of monotonic functions is defined whose least fixed points are weakly definable in the sense of Rabin. The author uses this property to give a new proof that \(\nu\) \(\mu\)-definable sets of trees are recognized by Rabin's special automata.
0 references
system of equations
0 references
tree automaton
0 references
special automaton
0 references
labelled tree
0 references
Büchi set
0 references
\(\nu \) \(\mu\)-definability
0 references
fixed points
0 references
