Author:
Berwanger Dietmar,Lenzi Giacomo
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arnold, A.: The mu-calculus alternation-depth is strict on binary trees. RAIRO Informatique Théorique et Applications 33, 329–339 (1999)
2. Arnold, A., Niwiński, D.: Rudiments of μ-calculus. North Holland, Amsterdam (2001)
3. Berwanger, D.: Game logic is strong enough for parity games. Studia Logica 75, 205–219 (2003); Special issue on Game Logic and Game Algebra edited by Pauly M., Parikh, R.
4. Lecture Notes in Artificial Intelligence;D. Berwanger,2001
5. Lecture Notes in Computer Science;D. Berwanger,2002
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complete Game Logic with Sabotage;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Even Flying Cops Should Think Ahead;Lecture Notes in Computer Science;2018
3. Undirected Graphs of Entanglement 2;FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science;2007
4. Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games;Logic for Programming, Artificial Intelligence, and Reasoning;2005