Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Automaton-based Characterisations of First Order Logic over Infinite Trees
Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.