Tree Automata Make Ordinal Theory Easy
Abstract
We give a new simple proof of the decidability of the First Order Theory of (omegaomegai,+) and the Monadic Second Order Theory of (omegai,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new representation of (sets of) ordinals by (infinite) trees.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.