Pages that link to "Item:Q3328514"
From MaRDI portal
The following pages link to DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2 (Q3328514):
Displaying 19 items.
- Determinization of ordinal automata (Q383176) (← links)
- Exact complexity bounds for ordinal addition (Q671516) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- On decidability properties of local sentences (Q860837) (← links)
- Ordinal machines and admissible recursion theory (Q1032634) (← links)
- The monadic theory of \((\omega{}_ 2,<)\) may be complicated (Q1190619) (← links)
- Decidability and definability results related to the elementary theory of ordinal multiplication (Q2773366) (← links)
- On countable chains having decidable monadic theory (Q2892678) (← links)
- Covering of ordinals (Q2920116) (← links)
- Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations (Q2947168) (← links)
- THE COMPLETE EXTENSIONS OF THE MONADIC SECOND ORDER THEORY OF COUNTABLE ORDINALS (Q3328512) (← links)
- AXIOMATIZATION OF THE MONADIC THEORY OF ORDINALS < ω2 (Q3346282) (← links)
- Finite state automata and monadic definability of singular cardinals (Q3503746) (← links)
- (Q3530398) (← links)
- Selection in the monadic theory of a countable ordinal (Q3617361) (← links)
- (Q4452075) (← links)
- (Q4939601) (← links)
- First-order and counting theories of<i>ω</i>-automatic structures (Q5387304) (← links)
- Decidable Expansions of Labelled Linear Orderings (Q5892516) (← links)