Finite State Automata and Monadic Definability of Singular Cardinals

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

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1208359052
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 42,156
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

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.

Analytics

Added to PP index
2010-08-24

Total views
7 ( #860,818 of 2,253,657 )

Recent downloads (6 months)
3 ( #605,823 of 2,253,657 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature