Tree Automata Make Ordinal Theory Easy
Thierry Cachat
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.
Create a lesson
Related papers
Algorithms for Robbins' Problem using Markov Decision Processes
Léonard Brice, F. Thomas Bruss, Anirban Majumdar et al.
Token-Level Advertising
Hanbing Liu, Bowei Zhang, Changyuan Yu et al.
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
Robust Lottery Compression for Metric Voting: A Transfer Principle for Bounded Randomness
Jianhao Jia, Bo Peng
A lone divider allocation algorithm with subjective divisibility
Uriel Feige
Trusting AI in Competitive Markets
Jussi Keppo, Yuze Li, Gerry Tsoukalas et al.