TY - JOUR
T1 - Random unary predicates
T2 - Almost sure theories and countable models
AU - Spencer, Joel H.
AU - St John, Katherine
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0032221889&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032221889&partnerID=8YFLogxK
U2 - 10.1002/(sici)1098-2418(199810/12)13:3/4<229::aid-rsa3>3.0.co;2-x
DO - 10.1002/(sici)1098-2418(199810/12)13:3/4<229::aid-rsa3>3.0.co;2-x
M3 - Article
AN - SCOPUS:0032221889
SN - 1042-9832
VL - 13
SP - 229
EP - 248
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 3-4
ER -