Logical definability of fixed points (Q1114673): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5753528 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Results on the propositional \(\mu\)-calculus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3730012 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5616162 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The greatest fixed-points and rational omega-tree languages / rank | |||
Normal rank | |||
Latest revision as of 13:46, 19 June 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
