Upper bound for the minimal quantifier depth of the first part of a monadic second-order sentence without asymptotic probability
Combinatorics
2018-02-15 v3 Logic
Abstract
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 for some irrational .
Keywords
Cite
@article{arxiv.1802.02671,
title = {Upper bound for the minimal quantifier depth of the first part of a monadic second-order sentence without asymptotic probability},
author = {Mickel González Sánchez and Maksim Evgenievich Zhukovskii},
journal= {arXiv preprint arXiv:1802.02671},
year = {2018}
}
Comments
no significant new ideas