Logical definability of fixed points (Q1114673): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90129-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2009275991 / rank | |||
Normal rank |
Revision as of 01:07, 20 March 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