Upper bound for the minimal quantifier depth of the first part of a monadic second-order sentence without asymptotic probability
In this paper we found an upper bound for the minimal quantifier depth of the first part of a monadic second-order sentence without asymptotic probability described by Jerzy Tyszkiewicz, which express the extension grid axiom in the Erd\H{o}s-R\'enyi model of random graphs $G(n,n^{-\alpha})$ for some irrational $\alpha$.
PDF AbstractCategories
Combinatorics
Logic
