Computer Science – Computer Science and Game Theory
Scientific paper
2006-10-30
Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, 2006, Proceedings. FSTTCS
Computer Science
Computer Science and Game Theory
Scientific paper
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.
No associations
LandOfFree
Tree Automata Make Ordinal Theory Easy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tree Automata Make Ordinal Theory Easy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree Automata Make Ordinal Theory Easy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-230341