McNaughton games and extracting strategies for concurrent programs

, &
Annals of Pure and Applied Logic 78 (1-3):203-242 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(95)00032-1

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,411

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

O'Donnell, MJ, see Lipton, J. 187-239 Remmel, JB, see Nerode, A. 125-170.S. Feferman - 1996 - Annals of Pure and Applied Logic 81:241.
Gurevich-Harrington's games defined by finite automata.Alexander Yakhnis & Vladimir Yakhnis - 1993 - Annals of Pure and Applied Logic 62 (3):265-294.
Polynomial-time analogues of isolatedness.Leon Harkleroad - 1992 - Annals of Pure and Applied Logic 56 (1-3):173-182.
Kagan, V., Nerode, A. and Subrahmanian, VS., Computing definite logic.M. A. da ArchangelskyTaitslin, S. Artemov, F. A. Bluerle, J. B. Remmel, R. Harper, D. Sannella & A. Tarlecki - 1994 - Annals of Pure and Applied Logic 67:349.
Extension of Gurevich-Harrington's restricted memory determinacy theorem: a criterion for the winning player and an explicit class of winning strategies.Alexander Yakhnis & Vladimir Yakhnis - 1990 - Annals of Pure and Applied Logic 48 (3):277-297.
Every recursive boolean algebra is isomorphic to one with incomplete atoms.Rod Downey - 1993 - Annals of Pure and Applied Logic 60 (3):193-206.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
Nerode Anil. Extensions to isols. Annals of mathematics, second series, vol. 73 , pp. 362–403.J. C. E. Dekker - 1960 - Journal of Symbolic Logic 25 (4):359-361.
BERGER, U., Total sets and objects in domain theory DOWNEY, R., Every recursive boolean algebra is isomorphic to one with incomplete atoms GONCHAREV, S., YAKHNIS, A. and YAKHNIS, V., Some effectively infinite classes of enumerations. [REVIEW]P. Lincoln, A. Scedrov & N. Shankar - 1993 - Annals of Pure and Applied Logic 60:291.
Anil Nerode. Diophantine correct non-standard models in the isols. Annals of mathematics, vol. 84 , pp. 421–432.Carl Bredlau - 1969 - Journal of Symbolic Logic 33 (4):619.

Analytics

Added to PP
2014-01-16

Downloads
15 (#1,125,764)

6 months
3 (#1,692,943)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On some games played on finite graphs.Bakhadyr Khoussainov - 2002 - Bulletin of the Section of Logic 31 (2):71-79.

Add more citations

References found in this work

Infinite games played on finite graphs.Robert McNaughton - 1993 - Annals of Pure and Applied Logic 65 (2):149-184.
Gurevich-Harrington's games defined by finite automata.Alexander Yakhnis & Vladimir Yakhnis - 1993 - Annals of Pure and Applied Logic 62 (3):265-294.

Add more references