Finite state automata and monadic definability of singular cardinals
Itay Neeman
Source: J. Symbolic Logic Volume 73, Issue 2 (2008), 412-438.
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.
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1208359052
Digital Object Identifier: doi:10.2178/jsl/1208359052
Mathematical Reviews number (MathSciNet):
MR2414457
Zentralblatt MATH identifier:
1148.03030
References
J. Richard Büchi, Decision methods in the theory of ordinals, Bulletin of the American Mathematical Society, vol. 71 (1965), pp. 767--770.
Mathematical Reviews (MathSciNet):
MR189997
Digital Object Identifier: doi:10.1090/S0002-9904-1965-11384-2
--------, The monadic second order theory of $\omega \sb1$, The monadic second order theory of all countable ordinals (Decidable theories, II), Lecture Notes in Mathematics, vol. 328, Springer, Berlin, 1973, pp. 1--127.
Mathematical Reviews (MathSciNet):
MR476471
Zentralblatt MATH:
0298.02050
J. Richard Büchi and Charles Zaiontz, Deterministic automata and the monadic theory of ordinals $<\omega \sb2$, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 29 (1983), no. 4, pp. 313--336.
Mathematical Reviews (MathSciNet):
MR715254
Y. Gurevich, Monadic second-order theories, Model-theoretic logics, Perspectives in Mathematical Logic, Springer, New York, 1985, pp. 479--506.
Mathematical Reviews (MathSciNet):
MR819544
Yuri Gurevich, Menachem Magidor, and Saharon Shelah, The monadic theory of $\omega \sb2$, Journal of Symbolic Logic, vol. 48 (1983), no. 2, pp. 387--398.
Mathematical Reviews (MathSciNet):
MR704093
Digital Object Identifier: doi:10.2307/2273556
Project Euclid: euclid.jsl/1183741255
Menachem Magidor, Reflecting stationary sets, Journal of Symbolic Logic, vol. 47 (1982), no. 4, pp. 755--771 (1983).
Mathematical Reviews (MathSciNet):
MR683153
Digital Object Identifier: doi:10.2307/2273097
Project Euclid: euclid.jsl/1183741137
Robert McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control, vol. 9 (1966), pp. 521--530.
Mathematical Reviews (MathSciNet):
MR213241
Saharon Shelah, The monadic theory of order, Annals of Mathematics. Second Series, vol. 102 (1975), no. 3, pp. 379--419.
Mathematical Reviews (MathSciNet):
MR491120
Digital Object Identifier: doi:10.2307/1971037
JSTOR: links.jstor.org
Jerzy Wojciechowski, Classes of transfinite sequences accepted by nondeterministic finite automata, Roczniki Polskiego Towarzystwa Matematycznego. Seria IV. Fundamenta Informaticae, vol. 7 (1984), no. 2, pp. 191--223.
Mathematical Reviews (MathSciNet):
MR773537
--------, Finite automata on transfinite sequences and regular expressions, Roczniki Polskiego Towarzystwa Matematycznego. Seria IV. Fundamenta Informaticae, vol. 8 (1985), no. 3--4, pp. 379--396.
Mathematical Reviews (MathSciNet):
MR810708
