Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
From MaRDI portal
Publication:5452198
DOI10.1007/978-3-540-78127-1_31zbMath1133.03313OpenAlexW1584718003MaRDI QIDQ5452198
Alexander Rabinovich, Amit Shomrat
Publication date: 25 March 2008
Published in: Pillars of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78127-1_31
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selection over classes of ordinals expanded by monadic predicates
- The monadic theory of order
- The first order properties of products of algebraic systems
- Weak Second‐Order Arithmetic and Finite Automata
- Rabin's uniformization problem
- Selection in the monadic theory of a countable ordinal
- The Church Problem for Countable Ordinals
- Decision Problems of Finite Automata Design and Related Arithmetics
- Uniformization and skolem functions in the class of trees
- The stationary set splitting game
- Solving Sequential Conditions by Finite-State Strategies
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey