𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple monadic theories and partition width

✍ Scribed by Achim Blumensath

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
226 KB
Volume
57
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Simple monadic theories and indiscernibl
Simple monadic theories and indiscernibles
✍ Achim Blumensath πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 228 KB

Aiming for applications in monadic second-order model theory, we study first-order theories without definable pairing functions. Our main results concern forking-properties of sequences of indiscernibles. These turn out to be very well-behaved for the theories under consideration.

Tree-width and the monadic quantifier hi
Tree-width and the monadic quantifier hierarchy
✍ J.A. Makowsky; J.P. MariΓ±o πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 269 KB

It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is

Surfaces, Tree-Width, Clique-Minors, and
Surfaces, Tree-Width, Clique-Minors, and Partitions
✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 214 KB

In 1971, Chartrand, Geller, and Hedetniemi conjectured that the edge set of a planar graph may be partitioned into two subsets, each of which induces an outerplanar graph. Some partial results towards this conjecture are presented. One such result, in which a planar graph may be thus edge partitione

Random Amalgamation of Simple Theories
Random Amalgamation of Simple Theories
✍ Akito Tsuboi πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 1 views