Order-Invariant MSO is Stronger than Counting MSO in the Finite

Ganzow, Tobias; Rubin, Sasha

Dagstuhl : Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI) (2008)
Contribution to a book, Contribution to a conference proceedings

In: Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science : Bordeaux, France, February 21-23, 2008 / Susanne Albers, Pascal Weil (Eds.)
Page(s)/Article-Nr.: 313-324

Institutions

  • Department of Mathematics [110000]
  • Mathematical Fundamentals of Computer Science (Logic and Complexity) Teaching and Research Area [117220]

Identifier