Abstract
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals.
Citation
Itay Neeman. "Finite state automata and monadic definability of singular cardinals." J. Symbolic Logic 73 (2) 412 - 438, June 2008. https://doi.org/10.2178/jsl/1208359052
Information
Published: June 2008
First available in Project Euclid: 16 April 2008
zbMATH: 1148.03030
MathSciNet: MR2414457
Digital Object Identifier: 10.2178/jsl/1208359052
Rights: Copyright © 2008 Association for Symbolic Logic
