Pebble games on trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2803, Issue , 2003, Pages 359-371

  Krzeszczakowski, Lukasz ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; FORESTRY; RECONFIGURABLE HARDWARE; TREES (MATHEMATICS);

DIRECTED TREES; INFINITARY; PEBBLE GAME; REGULAR TREE; ROOTED TREES; RUNNING-IN; SPECIAL CLASS; TIME LOG;

COMPUTER CIRCUITS;

EID: 34250622268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_29     Document Type: Article

References (6)

1. Barwise, J.: On Moschovakis closure ordinals. Journal of Symbolic Logic 42 (1977), 292-296
2. Grohe, M.: Equivalence in finite-variable logics is complete for polynomial time. Proceeding FOCS (1996)
3. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995)
4. Pezzoli, E.: Computational Complexity of Ehrenfeucht-Fraïsse Games on Finite Structures. Computer Science Logic, LNCS 1584 (1998), 159-170.
5. Pezzoli, E.: On the computational complexity of type-two functional and logical games on finite structures. Ph.D thesis. Stanford University. June 1998
6. Krzeszczakowski, L.: On the complexity of the problem of finding a winning strategy in model-theoretic games, (in Polish) M.Sc thesis. Warsaw University. September 2001