EMSO(FO^2) 0-1 Law Fails for All Dense Random Graphs

From MaRDI portal
Publication:5096587




Abstract: In this paper, we disprove EMSO(FO2) convergence law for the binomial random graph G(n,p) for any constant probability p. More specifically, we prove that there exists an existential monadic second order sentence with 2 first order variables such that, for every pin(0,1), the probability that it is true on G(n,p) does not converge.









This page was built for publication: EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs

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