This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Buchi, The Monadic Theory of ω1, in: Decidable Theories II, Lecture Notes in Mathematics, 328, 1–127.
Y. Gurevich and L. Harrington, Trees, Automata and Games, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, 60–65.
B. Khoussainov, A, Yakhnis, Games with Unknown Finite Past and Monadic Theories, Annals of Pure and Applied Logic, submitted.
D. Monk, The Gurevich-Harrington Proof of Rabin's Theorem, manuscript, Fall 1984, pp. 1–48.
R. McNaughton, Infinite Games Played on Finite Graphs, Annals of Pure and Applied Logic, v.65, N2, 1993, p.149–184.
D. Muller and P. Shupp, The Theory of Ends, Pushdown Automata, and Second order Logic, Theoretical Comp. Sc., Vol. 37, 1985, 51–75.
A. Nerode, A. Yakhnis, V. Yakhnis, Concurrent Programs as Strategies in Games, in Logic from Computer Science, Springer-Verlag, 1992, 405–479.
A. Nerode, A. Yakhnis, Modelling Hybrid Systems as Games, 31st IEEE Conference on decision and Control (CDC92), 1992, 2947–2952.
A. Nerode, A. Yakhnis, V. Yakhnis, Distributed Concurrent Programs as Strategies in Games, to appear in Logical Methods: A Symposium in honor of Prof. Anil Nerode's 60th birthday, Birkhauser, 1993.
M. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. of American Math. Soc, 141, 1969, 1–35.
M. Rabin, Weakly definable Relations and Special Automata, Mathematical Logic and Foundations of Set Theory, North-Holland, Amsterdam, 1970, 1–23.
H. Rogers, Theory of Recursive Function and Effective Computability, New York, 1967.
J. Stupp, The Lattice Model is Recursive in the Original Model, Ann. of Math. manuscript, The Hebrew University, Jerusalem, 1975, 1–25.
J. Thatcher and J. Wright, Generalized Finite Automata with an Application to a Decision problem of second Order Logic, Math. Systems Theory, 2, 1968, 57–82.
W. Thomas, Automata on Infinite Objects, in Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen editor, The MIT Press/Elsevier, 1990, 133–192.
K. Wisniewsky, A Generalization of Finite Automata, Fund. Informatika, 10, 1987, 415–436.
A. Yakhnis, V. Yakhnis, Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: a Criterion for the Winning Player and an explicit Class of Winning Strategies, Annals of Pure and Applied Logic, 48, 1990, 277–297.
A. Yakhnis, V. Yakhnis, Gurevich-Harrington's Games Defined by Finite Automata, Annals of Pure and Applied Logic, 61, 1993.
S. Zeitman, Unforgettable Forgetful Determinacy, to appear in Journal of Logic and Computation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khoussainov, B., Nerode, A. (1994). The notion of rank and games. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_21
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive