Random sparse unary predicates
Saharon Shelah, Joel Spencer · Random Structures and Algorithms · 1994
Abstract Random unary predicates U on [n] holding with probability p are examined with respect to sentences A in a first‐order language containing U and “less than.” When p = p(n) satisfies nk+1 ≪ 1 ≪ npk it is shown that Pr[A] approaches a limit dependent only on k and A. In a similar circular model the limit is shown to be zero or one. © 1994 John Wiley & Sons, Inc.