Random sparse unary predicates
Saharon Shelah, Joel Spencer
Abstract
The main result is the following Theorem: Let p=p(n) be such that p(n) in [0,1] for all n and either p(n)<< n-1 or for some positive integer k, n-1/k<< p(n)<< n-1/(k+1) or for all epsilon >0, n- epsilon<< p(n) and n- epsilon<< 1-p(n) or for some positive integer k, n-1/k<< 1-p(n)<< n-1/(k+1) or 1-p(n)<< n-1. Then p(n) satisfies the Zero-One Law for circular unary predicates. Inversely, if p(n) falls into none of the above categories then it does not satisfy the Zero-One Law for circular unary predicates.
Create a lesson
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski