Guarded Second-Order Logic, Spanning Trees, and Network Flows
Logic in Computer Science
2015-07-01 v2 Discrete Mathematics
Abstract
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 -sparse hypergraphs. In the first part of the present paper we extend this result to hypergraphs of arbitrary cardinality. In the second part, we present a generalisation dealing with methods to encode sets of vertices by single vertices.
Cite
@article{arxiv.0910.3085,
title = {Guarded Second-Order Logic, Spanning Trees, and Network Flows},
author = {Achim Blumensath},
journal= {arXiv preprint arXiv:0910.3085},
year = {2015}
}