Let Un, p be the random unary predicate and Tk be 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 ℳk of Tk of order type roughly that of Zk and show that no other models of Tk exist of smaller size.
|Original language||English (US)|
|Number of pages||20|
|Journal||Random Structures and Algorithms|
|State||Published - 1998|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics