2 search results - page 1 / 1 » Structure Theorem and Strict Alternation Hierarchy for FO2 o... |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
DLT
2010
13 years 6 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...