𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monadic Second-Order Logic and Transitive Closure Logics Over Trees

✍ Scribed by Hans-Jörg Tiede; Stephan Kepser

Publisher
Springer
Year
2009
Tongue
English
Weight
226 KB
Volume
7
Category
Article
ISSN
1570-7075

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

A Comparison of Tree Transductions Defin
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
✍ Roderick Bloem; Joost Engelfriet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Two well-known formalisms for the specification and computation of tree transductions are compared: the mso graph transducer and the attributed tree transducer with look-ahead, respectively. The mso graph transducer, restricted to trees, uses monadic second order logic to define the output tree in t

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

Embeddings between the elementary ontolo
Embeddings between the elementary ontology with an atom and the monadic second-order predicate logic
✍ Mitio Takano 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 304 KB

Let .EOA be the elementary ontology augmented by an additional axiom 3S (S 9 S), and let ~8 be the monadic second-order predicate logic. We show that the mapping ~ which was introduced by V. A. Smirnov is an embedding of EOA into LS. We also give an embedding of ZS into EOA. In Smirnov [3], he defi