Abstract
The early work of Kobrinskii and Trakhtenbrot (1965) and of Büchi (1962) established an “equivalence” between the monadic second-order theory of finite linear orders and the regular sets — in the following sense:
(+) Regular sets are exactly those definable in a second-order monadic predicate language.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bowen, K. A., 1979, “Model Theory for Modal Logic. Kripke Models for Modal Logic,” Synthese Library Vol. 127, Reidel, Dordrecht.
Büchi, J. R., 1962, On a Decision Method in Restricted Second Order Arithmetic, in: “Proc. 1960 Int. Cong. for Logic, Method. and Philos. of Sci.,” Stanford Univ. Press, Stanford, Calif.
Chellas, B. F., 1980, “Modal Logic,” Cambridge University Press, Cambridge, England.
Gécseg, F. and Steinby, M., 1982, “Tree Automata,” Akadémia Kiadó, Budapest (to appear in 1983).
Kobrinskii, N. E. and Trakhtenbrot, B. A., 1965, “A Theory of Finite Automata,” North-Holland, Amsterdam.
Kripke, S. A., 1971, Semantical Considerations on Modal Logic, in: “Reference and Modality,” L. Linsky, ed., Oxford University Press, Oxford.
Ladner, R. E., 1977, Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata, Inf. and Contr., 33:281–303.
McNaughton, R. and Papert, S., 1971, “Counter Free Automata,” MIT Press, Cambridge, Mass.
Shoenfield, J. R., 1967, “Mathematical Logic,” Addison-Wesley, Reading.
Steinby, M., 1982, Systolic Trees and Systolic Language Recognition by Tree Automata, to appear in Theor. Comp. Sci. 1983.
Thomas, W., 1981, A Combinatorial Approach to the Theory of ω-Automata, Inf. and Contr., 48:261–283.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer Science+Business Media New York
About this chapter
Cite this chapter
Talja, J. (1985). Semantic Games on Finite Trees. In: Dorn, G., Weingartner, P. (eds) Foundations of Logic and Linguistics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0548-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4899-0548-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-0550-5
Online ISBN: 978-1-4899-0548-2
eBook Packages: Springer Book Archive