A class of finite structures has a 0᎐1 law with respect to a logic if every property expressible in the logic has a probability approaching a limit of 0 or 1 as the Ž structure size grows. To formulate 0᎐1 laws for maps i.e., embeddings of graphs in a . surface , it is necessary to represent maps as
✦ LIBER ✦
0-1 laws for recursive structures
✍ Scribed by E. Grädel; A. Malmström
- Book ID
- 105842569
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 83 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
0–1 laws for maps
✍
Edward A. Bender; Kevin J. Compton; L. Bruce Richmond
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 298 KB
0–1 laws by preservation
✍
Thierry Lacoste
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 612 KB
Our central result asserts that a (logical) language preserved under extension of models has a O-l law under the uniform probability distribution. We then investigate some fragments of the first-order infinitary logic L,, and of second-order logic which are preserved under extension. This paper reve
Cellular structures for implementing rec
✍
de Mori, Renato
📂
Article
📅
1976
🏛
Institution of Electrical Engineers
⚖ 959 KB
Distributive laws for the coinductive so
✍
Bart Jacobs
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 288 KB
Submaps of maps. I. General 0–1 laws
✍
Edward A Bender; Zhi-Cheng Gao; L.Bruce Richmond
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 756 KB
Recursive domain equations for concrete
✍
Manfred Droste
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 889 KB