Logical definability of fixed points (Q1114673)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4083599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logical definability of fixed points |
scientific article; zbMATH DE number 4083599 |
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
0.7344614863395691
0 references
