Monadic logic and löwenheim numbers
✍ Scribed by Saharon Shelah
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 887 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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.
For any property d~ of a model (or graph), let ~n(&) be the fraction of models of power n which satisfy &, and let ~(d~) = lim~\_\_~ Izn(d)) if this limit exists. For first-order properties &, it is known that ~(&) must be 0 or 1. We answer a question of K. Compton by proving in a strong way that th