Zero-one laws for existential first-order sentences of bounded quantifier depth

From MaRDI portal



Abstract: For any fixed positive integer k, let alphak denote the smallest alphain(0,1) such that the random graph sequence leftGleft(n,n−alphaight)ight does not satisfy the zero-one law for the set mathcalEk of all existential first order sentences that are of quantifier depth at most k. This paper finds upper and lower bounds on alphak, showing that as kightarrowinfty, we have alphak=left(k−2−t(k)ight)−1 for some function t(k)=Theta(k−2). We also establish the precise value of alphak when k=4.











This page was built for publication: Zero-one laws for existential first-order sentences of bounded quantifier depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034234)