Skip to Main content Skip to Navigation
Conference papers

Tree Automata Make Ordinal Theory Easy

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00110485
Contributor : Thierry Cachat <>
Submitted on : Monday, October 30, 2006 - 11:33:03 AM
Last modification on : Saturday, March 28, 2020 - 2:19:34 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 6:53:04 PM

Identifiers

Collections

Citation

Thierry Cachat. Tree Automata Make Ordinal Theory Easy. 2006, pp.286-297. ⟨hal-00110485⟩

Share

Metrics

Record views

169

Files downloads

585