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

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1208359052

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

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

Through your library

My notes

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.
Does a rock implement every finite-state automaton?David J. Chalmers - 1996 - Synthese 108 (3):309-33.
Simulating polyadic modal logics by monadic ones.George Goguadze, Carla Piazza & Yde Venema - 2003 - Journal of Symbolic Logic 68 (2):419-462.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
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.
Finite state automata and simple recurrent networks.Axel Cleeremans & David Servan-Schreiber - unknown
Finite automata, real time processes and counting problems in bounded arithmetics.Mirosław Kutyłowski - 1988 - Journal of Symbolic Logic 53 (1):243-258.
Construction of monadic three-valued łukasiewicz algebras.Luiz Monteiro, Sonia Savini & Julio Sewald - 1991 - Studia Logica 50 (3-4):473 - 483.
Behaviorism, finite automata, and stimulus response theory.Raymond J. Nelson - 1975 - Theory and Decision 6 (August):249-67.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Weakly infinite cardinals.Roy Lisker - unknown

Analytics

Added to PP
2010-08-24

Downloads
27 (#608,062)

6 months
16 (#172,704)

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