DMCA
Random Unary Predicates: Almost Sure Theories and Countable Models, Random Structures & Algorithms 13 (1998)
by
Joel H. Spencer
,
Katherine St. John
| Citations: | 2 - 2 self |
BibTeX
@MISC{Spencer98randomunary,
author = {Joel H. Spencer and Katherine St. John},
title = {Random Unary Predicates: Almost Sure Theories and Countable Models, Random Structures & Algorithms 13},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n −1/k ≪ p(n) ≪ n −1/(k+1). For each k, we give an axiomatization for the theory Tk. We find a model Mk of Tk of order type roughly that of Z k and show that no other models of Tk exist of smaller size. 1
