Gurevich-Harrington's games defined by finite automata
- 1 July 1993
- journal article
- Published by Elsevier BV in Annals of Pure and Applied Logic
- Vol. 62 (3), 265-294
- https://doi.org/10.1016/0168-0072(93)90239-a
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Unforgettable Forgetful DeterminacyJournal of Logic and Computation, 1994
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: a criterion for the winning player and an explicit class of winning strategiesAnnals of Pure and Applied Logic, 1990
- A purely inductive proof of Borel determinacyPublished by American Mathematical Society (AMS) ,1985
- A starvation-free solution to the mutual exclusion problemInformation Processing Letters, 1979
- On Some Games Which Are Relevant to the Theory of Recursively Enumerable SetsAnnals of Mathematics, 1970
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969
- The strict determinateness of certain infinite gamePacific Journal of Mathematics, 1955