✦ LIBER ✦
Random unary predicates: Almost sure theories and countable models
✍ Scribed by Joel H. Spencer; Katherine St. John
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 252 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
✦ Synopsis
Let U be the random unary predicate and T be the almost sure first-order n, p k y1r k Ž . theory of U under the linear ordering, where k is a positive integer and n < p n < n, p n y1rŽ kq1. . For each k, we give an axiomatization for the theory T . We find a model M M of k k T of order type roughly that of Z k and show that no other models of T exist of smaller k k