Dagstuhl Seminar Proceedings. 07441 - Algorithmic-Logical Theory of Infinite Structures
Doi
Abstract
We give a new simple proof of the decidability of the First Order Theory of
(wwi,+) and the Monadic Second Order Theory of (wi,<), improving the
complexity in both cases. Our algorithm is based on tree automata and a new
representation of (sets of) ordinals by (infinite) trees