On some games played on finite graphs

Bulletin of the Section of Logic 31 (2):71-79 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

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

Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740. [REVIEW]Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401.
Infinite games played on finite graphs.Robert McNaughton - 1993 - Annals of Pure and Applied Logic 65 (2):149-184.
Some numerical characterization of finite distributive lattices.Joanna Grygiel - 2004 - Bulletin of the Section of Logic 33 (3):127-133.
Some properties of strongly finite propositional calculi.Ryszard Wojcicki - 1972 - Bulletin of the Section of Logic 1 (1):69-71.
Cycles in Nielsen's Graphs.Anna Bien - 2010 - Bulletin of the Section of Logic 39 (1/2):57-64.
Finite model property for some intuitionistic modal logics.Yasusi Hasimoto - 2001 - Bulletin of the Section of Logic 30 (2):87-97.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Descriptive complexity of modularity problems on graphs.Haroldo G. Benatti & Ruy Jgb de Queiroz - 2005 - Bulletin of the Section of Logic 34 (2):61-75.

Analytics

Added to PP
2014-01-18

Downloads
43 (#525,710)

6 months
3 (#1,491,886)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

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.

Add more references