The \(\mathrm{FO}^2\) alternation hierarchy is decidable (Q4649563)
From MaRDI portal
!
WARNING
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 6109849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(\mathrm{FO}^2\) alternation hierarchy is decidable |
scientific article; zbMATH DE number 6109849 |
Statements
22 November 2012
0 references
first-order logic
0 references
regular language
0 references
automata theory
0 references
semigroup
0 references
condensed ranker
0 references
0.9161497354507446
0 references
0.911504328250885
0 references
0.9058120846748352
0 references
0.9020761847496032
0 references
0.8644677996635437
0 references
