Tree Automata Make Ordinal Theory Easy
Computer Science and Game Theory
2007-05-23 v1
Abstract
We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new representation of (sets of) ordinals by (infinite) trees.
Cite
@article{arxiv.cs/0610166,
title = {Tree Automata Make Ordinal Theory Easy},
author = {Thierry Cachat},
journal= {arXiv preprint arXiv:cs/0610166},
year = {2007}
}