随机性与半泛型
Randomness and semigenericity
摘要:
设L只包含等式符号,L^+是包含L的任意有限对称关系语言。假设概率定义在有限L^+结构上,其“边概率”为n^{- alpha}。随机L^+结构的几乎必然理论T^alpha是指具有极限概率1的L^+句子的集合。T_alpha表示K_alpha(有限图G的集合,满足delta_{alpha}(G)= |G| - alpha)的类属结构理论. | G的边|(非负的)。定理:T_alpha,随机L^+结构的几乎必然理论,与K_alpha类属模型的理论T_alpha相同。这个理论是完整的,稳定的,几乎模型完整。此外,它具有有限模型的性质,只有无限个模型,因此是不可公理化的。
英文摘要:
Let L contain only the equality symbol and let L^+ be an arbitrary finite symmetric relational language containing L . Suppose probabilities are defined on finite L^+ structures with ''edge probability'' n^{- alpha}. By T^alpha, the almost sure theory of random L^+-structures we mean the collection of L^+-sentences which have limit probability 1. T_alpha denotes the theory of the generic structures for K_alpha, (the collection of finite graphs G with delta_{alpha}(G)=|G|- alpha. | edges of G | hereditarily nonnegative.) THEOREM: T_alpha, the almost sure theory of random L^+-structures is the same as the theory T_alpha of the K_alpha-generic model. This theory is complete, stable, and nearly model complete. Moreover, it has the finite model property and has only infinite models so is not finitely axiomatizable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。