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...
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Logical Methods in Computer Science e.V.
2010-02-01
|
| Ráidu: | Logical Methods in Computer Science |
| Fáttát: | |
| Liŋkkat: | https://lmcs.episciences.org/1207/pdf |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|