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...
में बचाया:
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Logical Methods in Computer Science e.V.
2010-02-01
|
| श्रृंखला: | Logical Methods in Computer Science |
| विषय: | |
| ऑनलाइन पहुंच: | https://lmcs.episciences.org/1207/pdf |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|