Finite state automata and monadic definability of singular cardinals

DOI10.2178/JSL/1208359052zbMath1148.03030OpenAlexW2122112120MaRDI QIDQ3503746

Itay Neeman

Publication date: 9 June 2008

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1208359052

zbMATH Keywords

definabilitysingular cardinalclass of ordinalsmonadic second-order formula

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Ordinal and cardinal numbers (03E10)

Related Items (2)

Pumping for ordinal-automatic structures1 ⋮ Some problems in automata theory which depend on the models of set theory

Cites Work

• The monadic theory of order
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• The monadic theory of ω₂
• Decision methods in the theory of ordinals
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Finite state automata and monadic definability of singular cardinals