Finite State Automata and Monadic Definability of Singular Cardinals

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

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

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 on ordinals and automaticity of linear orders.Philipp Schlicht & Frank Stephan - 2013 - Annals of Pure and Applied Logic 164 (5):523-527.
Weak Second-Order Arithmetic and Finite Automata.J. Richard Buchi - 1963 - Journal of Symbolic Logic 28 (1):100-102.
Automata and Finite Automata.C. Y. Lee - 1971 - Journal of Symbolic Logic 36 (3):534-535.

Analytics

Added to PP
2010-08-24

Downloads
16 (#935,433)

6 months
27 (#114,075)

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