论文信息 - Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games - 字舞流文

Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games

We study determinacy, definability and complexity issues of path games on finite and infinite graphs.

Stephan Kreutzer | Dietmar Berwanger | Erich Grädel | E. Grädel | Dietmar Berwanger | S. Kreutzer

[1] Igor Walukiewicz,et al. How much memory is needed to win infinite games? , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[2] A. Kanamori. The Higher Infinite , 1994 .

[3] A. Kechris. Classical descriptive set theory , 1987 .

[4] Marco Pistore,et al. The planning spectrum - one, two, three, infinity , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[5] Wolfgang Thomas,et al. A Combinatorial Approach to the Theory of omega-Automata , 1981, Inf. Control..

[6] R. Daniel Mauldin,et al. The Scottish book : mathematics from the Scottish Café , 1981 .

[7] Faron Moller,et al. Counting on CTL*: on the expressive power of monadic path logic , 2003, Inf. Comput..

[8] Igor Walukiewicz,et al. On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.

[9] Wolfgang Thomas,et al. Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree , 1987, ICALP.