Decision methods in the theory of ordinals
From MaRDI portal
Publication:5608006
Cites work
- Decision Problems of Finite Automata Design and Related Arithmetics
- scientific article; zbMATH DE number 3171141 (Why is no real title available?)
- scientific article; zbMATH DE number 3329919 (Why is no real title available?)
- The first order properties of products of algebraic systems
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(20)- Constructivizations of Boolean algebras
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Theory of -languages. I: Characterizations of -context- free languages
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- Finite automata and ordinals
- Logic over words on denumerable ordinals
- Monadic second-order logic on tree-like structures
- Löwenheim numbers for skeletons of varieties
- Tree acceptors and some of their applications
- Tree-automatic scattered linear orders
- On elementary theories of ordinal notation systems based on reflection principles
- Finite state automata and monadic definability of singular cardinals
- Determinization of ordinal automata
- Decidability of second-order theories and automata on infinite trees
- Schützenberger and Eilenberg theorems for words on linear orderings
- Space-bounded OTMs and REG ∞
- Pumping for ordinal-automatic structures1
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- Automatic structures and the problem of natural well-orderings
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by
This page was built for publication: Decision methods in the theory of ordinals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5608006)
