𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quantification and Second-Order Monadicity

✍ Scribed by Paul M. Pietroski

Book ID
109061363
Publisher
Blackwell Publishing
Year
2003
Tongue
English
Weight
223 KB
Volume
17
Category
Article
ISSN
1758-2245

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The monadic second-order logic of graphs
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
✍ Bruno Courcelle πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 342 KB

We consider the class US k of uniformly k-sparse simple graphs, i.e., the class of ΓΏnite or countable simple graphs, every ΓΏnite subgraph of which has a number of edges bounded by k times the number of vertices. We prove that for each k, every monadic second-order formula (intended to express a grap

On second-order iterative monads
On second-order iterative monads
✍ JiΕ™Γ­ AdΓ‘mek; Stefan Milius; JiΕ™Γ­ Velebil πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 374 KB
Circle graphs and monadic second-order l
Circle graphs and monadic second-order logic
✍ Bruno Courcelle πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 357 KB

This article is part of a project consisting in expressing, whenever possible, graph properties and graph transformations in monadic second-order logic or in its extensions using modulo p cardinality set predicates or auxiliary linear orders. A circle graph is the intersection graph of a set of chor

Monadic Second Order Logic And Its Fragm
Monadic Second Order Logic And Its Fragments
✍ Giacomo Lenzi πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 230 KB

Various recent results about monadic second order logic and its fragments are presented. These results have been obtained in the framework of the EU TMR Project GETGRATS.