Finite State Automata and Monadic Definability of Singular Cardinals

Journal of Symbolic Logic 73 (2):412 - 438 (2008)
  Copy   BIBTEX


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



    Upload a copy of this work     Papers currently archived: 91,164

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
Successive weakly compact or singular cardinals.Ralf-Dieter Schindler - 1999 - Journal of Symbolic Logic 64 (1):139-146.
Ad and patterns of singular cardinals below θ.Arthur W. Apter - 1996 - Journal of Symbolic Logic 61 (1):225-235.
Modifiable automata self-modifying automata.J.-P. Moulin - 1992 - Acta Biotheoretica 40 (2-3):195-204.


Added to PP

16 (#851,323)

6 months
7 (#339,156)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references