Guarded Second-Order Logic, Spanning Trees, and Network Flows

According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the first part of the present paper we extend this result to hyperg...

Full description

Bibliographic Details

Published in:	Logical Methods in Computer Science
Main Author:	Achim Blumensath
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2010-02-01
Subjects:	computer science - logic in computer science computer science - discrete mathematics g.2.2 f.4.1
Online Access:	https://lmcs.episciences.org/1207/pdf