DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
From MaRDI portal
Publication:3328514
Recommendations
Cited in
(26)- Ordinal machines and admissible recursion theory
- The monadic theory of \((\omega{}_ 2,<)\) may be complicated
- Decidability and definability results related to the elementary theory of ordinal multiplication
- On countable chains having decidable monadic theory
- Covering of ordinals
- Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations
- scientific article; zbMATH DE number 4016858 (Why is no real title available?)
- THE COMPLETE EXTENSIONS OF THE MONADIC SECOND ORDER THEORY OF COUNTABLE ORDINALS
- The monadic theory of ω2
- scientific article; zbMATH DE number 3880651 (Why is no real title available?)
- AXIOMATIZATION OF THE MONADIC THEORY OF ORDINALS < ω2
- Finite state automata and monadic definability of singular cardinals
- scientific article; zbMATH DE number 5354049 (Why is no real title available?)
- Selection in the monadic theory of a countable ordinal
- Determinization of ordinal automata
- scientific article; zbMATH DE number 1086492 (Why is no real title available?)
- scientific article; zbMATH DE number 2040919 (Why is no real title available?)
- Monadic theories of wellorders
- scientific article; zbMATH DE number 2087209 (Why is no real title available?)
- scientific article; zbMATH DE number 1400048 (Why is no real title available?)
- Tree Automata Make Ordinal Theory Easy
- First-order and counting theories ofω-automatic structures
- Exact complexity bounds for ordinal addition
- Monadic partition logics and finite automata
- On the expansion of monadic second-order logic with Cantor-Bendixson rank and order type predicates
- On decidability properties of local sentences
This page was built for publication: DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328514)