Lower Bounds for the Complexity of Monadic Second-Order Logic Stephan Kreutzer University of Oxford Abstract—Courcelle’s famous theorem from 1990 states that

First Page		Document Content
Date: 2015-06-17 12:07:42		Lower Bounds for the Complexity of Monadic Second-Order Logic Stephan Kreutzer University of Oxford Abstract—Courcelle’s famous theorem from 1990 states that Add to Reading List Source URL: logic.las.tu-berlin.de Download Document from Source Website File Size: 225,87 KB Share Document on Facebook