Pub Date : 2020-08-04DOI: 10.1142/S0219061321500306
Rosario Mennuni
We study the monoid of global invariant types modulo domination-equivalence in the context of o-minimal theories. We reduce its computation to the problem of proving that it is generated by classes of [Formula: see text]-types. We show this to hold in Real Closed Fields, where generators of this monoid correspond to invariant convex subrings of the monster model. Combined with [C. Ealy, D. Haskell and J. Maríková, Residue field domination in real closed valued fields, Notre Dame J. Formal Logic 60(3) (2019) 333–351], this allows us to compute the domination monoid in the weakly o-minimal theory of Real Closed Valued Fields.
在0极小理论的背景下，研究了整体不变型模控制-等价的单群。我们将其计算简化为证明它是由[公式:见文本]-类型类生成的问题。我们在实闭场中证明了这一点，其中这个单oid的生成器对应于怪物模型的不变凸子。与[C]结合;Ealy, D. Haskell和J. Maríková， real闭值域中的剩余域控制，Notre Dame J. Formal Logic 60(3)(2019) 333-351]，这允许我们计算实闭值域的弱o-极小理论中的控制单oid。
{"title":"The domination monoid in o-minimal theories","authors":"Rosario Mennuni","doi":"10.1142/S0219061321500306","DOIUrl":"https://doi.org/10.1142/S0219061321500306","url":null,"abstract":"We study the monoid of global invariant types modulo domination-equivalence in the context of o-minimal theories. We reduce its computation to the problem of proving that it is generated by classes of [Formula: see text]-types. We show this to hold in Real Closed Fields, where generators of this monoid correspond to invariant convex subrings of the monster model. Combined with [C. Ealy, D. Haskell and J. Maríková, Residue field domination in real closed valued fields, Notre Dame J. Formal Logic 60(3) (2019) 333–351], this allows us to compute the domination monoid in the weakly o-minimal theory of Real Closed Valued Fields.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"10 1","pages":"2150030:1-2150030:36"},"PeriodicalIF":0.9,"publicationDate":"2020-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78954872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-03DOI: 10.1142/s021906132250009x
D. Dzhafarov, D. Hirschfeldt, Sarah C. Reitzes
Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between [Formula: see text] principles over [Formula: see text]-models of [Formula: see text]. They also introduced a version of this game that similarly captures provability over [Formula: see text]. We generalize and extend this game-theoretic framework to other formal systems, and establish a certain compactness result that shows that if an implication [Formula: see text] between two principles holds, then there exists a winning strategy that achieves victory in a number of moves bounded by a number independent of the specific run of the game. This compactness result generalizes an old proof-theoretic fact noted by H. Wang (1981), and has applications to the reverse mathematics of combinatorial principles. We also demonstrate how this framework leads to a new kind of analysis of the logical strength of mathematical problems that refines both that of reverse mathematics and that of computability-theoretic notions such as Weihrauch reducibility, allowing for a kind of fine-structural comparison between [Formula: see text] principles that has both computability-theoretic and proof-theoretic aspects, and can help us distinguish between these, for example by showing that a certain use of a principle in a proof is “purely proof-theoretic”, as opposed to relying on its computability-theoretic strength. We give examples of this analysis to a number of principles at the level of [Formula: see text], uncovering new differences between their logical strengths.
{"title":"Reduction games, provability and compactness","authors":"D. Dzhafarov, D. Hirschfeldt, Sarah C. Reitzes","doi":"10.1142/s021906132250009x","DOIUrl":"https://doi.org/10.1142/s021906132250009x","url":null,"abstract":"Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between [Formula: see text] principles over [Formula: see text]-models of [Formula: see text]. They also introduced a version of this game that similarly captures provability over [Formula: see text]. We generalize and extend this game-theoretic framework to other formal systems, and establish a certain compactness result that shows that if an implication [Formula: see text] between two principles holds, then there exists a winning strategy that achieves victory in a number of moves bounded by a number independent of the specific run of the game. This compactness result generalizes an old proof-theoretic fact noted by H. Wang (1981), and has applications to the reverse mathematics of combinatorial principles. We also demonstrate how this framework leads to a new kind of analysis of the logical strength of mathematical problems that refines both that of reverse mathematics and that of computability-theoretic notions such as Weihrauch reducibility, allowing for a kind of fine-structural comparison between [Formula: see text] principles that has both computability-theoretic and proof-theoretic aspects, and can help us distinguish between these, for example by showing that a certain use of a principle in a proof is “purely proof-theoretic”, as opposed to relying on its computability-theoretic strength. We give examples of this analysis to a number of principles at the level of [Formula: see text], uncovering new differences between their logical strengths.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"2 1","pages":"2250009:1-2250009:37"},"PeriodicalIF":0.9,"publicationDate":"2020-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76310105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-21DOI: 10.1142/S0219061321500124
J. Kennedy, M. Magidor, Jouko Vaananen
We introduce a new inner model $C(aa)$ arising from stationary logic. We show that assuming a proper class of Woodin cardinals, or alternatively $MM^{++}$, the regular uncountable cardinals of $V$ are measurable in the inner model $C(aa)$, the theory of $C(aa)$ is (set) forcing absolute, and $C(aa)$ satisfies CH. We introduce an auxiliary concept that we call club determinacy, which simplifies the construction of $C(aa)$ greatly but may have also independent interest. Based on club determinacy, we introduce the concept of aa-mouse which we use to prove CH and other properties of the inner model $C(aa)$.
{"title":"Inner models from extended logics: Part 1","authors":"J. Kennedy, M. Magidor, Jouko Vaananen","doi":"10.1142/S0219061321500124","DOIUrl":"https://doi.org/10.1142/S0219061321500124","url":null,"abstract":"We introduce a new inner model $C(aa)$ arising from stationary logic. We show that assuming a proper class of Woodin cardinals, or alternatively $MM^{++}$, the regular uncountable cardinals of $V$ are measurable in the inner model $C(aa)$, the theory of $C(aa)$ is (set) forcing absolute, and $C(aa)$ satisfies CH. We introduce an auxiliary concept that we call club determinacy, which simplifies the construction of $C(aa)$ greatly but may have also independent interest. Based on club determinacy, we introduce the concept of aa-mouse which we use to prove CH and other properties of the inner model $C(aa)$.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"63 1","pages":"2150012:1-2150012:53"},"PeriodicalIF":0.9,"publicationDate":"2020-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74793119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-15DOI: 10.1142/s0219061322500040
Pablo Cubides Kovacsics, Françoise Delon
We show that every definable nested family of closed and bounded subsets of a [Formula: see text]-minimal field [Formula: see text] has nonempty intersection. As an application we answer a question of Darnière and Halupczok showing that [Formula: see text]-minimal fields satisfy the “extreme value property”: for every closed and bounded subset [Formula: see text] and every interpretable continuous function [Formula: see text] (where [Formula: see text] denotes the value group), [Formula: see text] admits a maximal value. Two further corollaries are obtained as a consequence of their work. The first one shows that every interpretable subset of [Formula: see text] is already interpretable in the language of rings, answering a question of Cluckers and Halupczok. This implies in particular that every [Formula: see text]-minimal field is polynomially bounded. The second one characterizes those [Formula: see text]-minimal fields satisfying a classical cell preparation theorem as those having definable Skolem functions, generalizing a result of Mourgues.
{"title":"Definable completeness of P-minimal fields and applications","authors":"Pablo Cubides Kovacsics, Françoise Delon","doi":"10.1142/s0219061322500040","DOIUrl":"https://doi.org/10.1142/s0219061322500040","url":null,"abstract":"We show that every definable nested family of closed and bounded subsets of a [Formula: see text]-minimal field [Formula: see text] has nonempty intersection. As an application we answer a question of Darnière and Halupczok showing that [Formula: see text]-minimal fields satisfy the “extreme value property”: for every closed and bounded subset [Formula: see text] and every interpretable continuous function [Formula: see text] (where [Formula: see text] denotes the value group), [Formula: see text] admits a maximal value. Two further corollaries are obtained as a consequence of their work. The first one shows that every interpretable subset of [Formula: see text] is already interpretable in the language of rings, answering a question of Cluckers and Halupczok. This implies in particular that every [Formula: see text]-minimal field is polynomially bounded. The second one characterizes those [Formula: see text]-minimal fields satisfying a classical cell preparation theorem as those having definable Skolem functions, generalizing a result of Mourgues.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"65 1","pages":"2250004:1-2250004:16"},"PeriodicalIF":0.9,"publicationDate":"2020-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86372251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-05-14DOI: 10.1142/s0219061323500071
L. Kolodziejczyk, Tin Lok Wong, K. Yokoyama
We prove that any proof of a $forall Sigma^0_2$ sentence in the theory $mathrm{WKL}_0 + mathrm{RT}^2_2$ can be translated into a proof in $mathrm{RCA}_0$ at the cost of a polynomial increase in size. In fact, the proof in $mathrm{RCA}_0$ can be found by a polynomial-time algorithm. On the other hand, $mathrm{RT}^2_2$ has non-elementary speedup over the weaker base theory $mathrm{RCA}^*_0$ for proofs of $Sigma_1$ sentences. We also show that for $n ge 0$, proofs of $Pi_{n+2}$ sentences in $mathrm{B}Sigma_{n+1}+exp$ can be translated into proofs in $mathrm{I}Sigma_{n} + exp$ at polynomial cost. Moreover, the $Pi_{n+2}$-conservativity of $mathrm{B}Sigma_{n+1} + exp$ over $mathrm{I}Sigma_{n} + exp$ can be proved in $mathrm{PV}$, a fragment of bounded arithmetic corresponding to polynomial-time computation. For $n ge 1$, this answers a question of Clote, Hajek, and Paris.
我们证明了$mathrm理论中$ for all Sigma ^0_2$句子的任何证明{WKL}_0+mathrm｛RT｝^2_2$可以转换为$mathrm中的证明{RCA}_0以多项式大小增加为代价。事实上，$mathrm中的证明{RCA}_0$可以通过多项式时间算法找到。另一方面，对于$Sigma_1$句子的证明，$mathrm｛RT｝^2_2$比较弱的基础理论$mathrm{RCA｝^*_0$具有非初等加速。我们还证明了对于$nge0$，$mathrm｛B｝Sigma｛n+1｝+exp$中的$Pi_｛n+2｝$句子的证明可以以多项式代价转换为$mathrm{I｝Sigma_｛n｝+exp$中的证明。此外，$mathrm{B}Sigma{n+1}+exp$在$mathrm{I}Sigmon{n}+exp$上的$Pi_{n+2}$守恒性可以在$math rm{PV}$中得到证明，$math rm{PV}$是一个与多项式时间计算相对应的有界算术片段。对于$nge 1$，这回答了Clote、Hajek和Paris的问题。
{"title":"Ramsey's theorem for pairs, collection, and proof size","authors":"L. Kolodziejczyk, Tin Lok Wong, K. Yokoyama","doi":"10.1142/s0219061323500071","DOIUrl":"https://doi.org/10.1142/s0219061323500071","url":null,"abstract":"We prove that any proof of a $forall Sigma^0_2$ sentence in the theory $mathrm{WKL}_0 + mathrm{RT}^2_2$ can be translated into a proof in $mathrm{RCA}_0$ at the cost of a polynomial increase in size. In fact, the proof in $mathrm{RCA}_0$ can be found by a polynomial-time algorithm. On the other hand, $mathrm{RT}^2_2$ has non-elementary speedup over the weaker base theory $mathrm{RCA}^*_0$ for proofs of $Sigma_1$ sentences. \u0000We also show that for $n ge 0$, proofs of $Pi_{n+2}$ sentences in $mathrm{B}Sigma_{n+1}+exp$ can be translated into proofs in $mathrm{I}Sigma_{n} + exp$ at polynomial cost. Moreover, the $Pi_{n+2}$-conservativity of $mathrm{B}Sigma_{n+1} + exp$ over $mathrm{I}Sigma_{n} + exp$ can be proved in $mathrm{PV}$, a fragment of bounded arithmetic corresponding to polynomial-time computation. For $n ge 1$, this answers a question of Clote, Hajek, and Paris.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"1 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2020-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43520843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-01DOI: 10.1142/S021906132050004X
J. Bagaria, M. Magidor, Salvador Mancilla
We introduce the large-cardinal notions of [Formula: see text]-greatly-Mahlo and [Formula: see text]-reflection cardinals and prove (1) in the constructible universe, [Formula: see text], the first [Formula: see text]-reflection cardinal, for [Formula: see text] a successor ordinal, is strictly between the first [Formula: see text]-greatly-Mahlo and the first [Formula: see text]-indescribable cardinals, (2) assuming the existence of a [Formula: see text]-reflection cardinal [Formula: see text] in [Formula: see text], [Formula: see text] a successor ordinal, there exists a forcing notion in [Formula: see text] that preserves cardinals and forces that [Formula: see text] is [Formula: see text]-stationary, which implies that the consistency strength of the existence of a [Formula: see text]-stationary cardinal is strictly below a [Formula: see text]-indescribable cardinal. These results generalize to all successor ordinals [Formula: see text] the original same result of Mekler–Shelah [A. Mekler and S. Shelah, The consistency strength of every stationary set reflects, Israel J. Math. 67(3) (1989) 353–365] about a [Formula: see text]-stationary cardinal, i.e. a cardinal that reflects all its stationary sets.
我们引入[公式:见文]-great - mahlo和[公式:见文]-反射基数的大基数概念，并证明(1)在可构造宇宙中，[公式:见文]，第一个[公式:见文]-反射基数，对于[公式:见文]一个后继序数，严格地介于第一个[公式:见文]-great - mahlo和第一个[公式:见文]-不可描述基数之间，(2)假设存在一个[公式:见文]-反射基数[公式:见文]:在[公式:见文]中，[公式:见文]是后继序数，在[公式:见文]中存在一个强制概念，它保留了基数，并强制[公式:见文]是[公式:见文]-静止的，这意味着[公式:见文]-静止基数存在的一致性强度严格低于[公式:见文]-不可描述的基数。这些结果推广到所有后继序数[公式:见文]，Mekler-Shelah [A。Mekler and S. Shelah, The consistency strength of every stationary set reflections, Israel J. Math. 67(3)(1989) 353-365]关于一个[公式:见正文]-stationary cardinal，即一个反映其所有stationary sets的基数。
{"title":"The consistency strength of hyperstationarity","authors":"J. Bagaria, M. Magidor, Salvador Mancilla","doi":"10.1142/S021906132050004X","DOIUrl":"https://doi.org/10.1142/S021906132050004X","url":null,"abstract":"We introduce the large-cardinal notions of [Formula: see text]-greatly-Mahlo and [Formula: see text]-reflection cardinals and prove (1) in the constructible universe, [Formula: see text], the first [Formula: see text]-reflection cardinal, for [Formula: see text] a successor ordinal, is strictly between the first [Formula: see text]-greatly-Mahlo and the first [Formula: see text]-indescribable cardinals, (2) assuming the existence of a [Formula: see text]-reflection cardinal [Formula: see text] in [Formula: see text], [Formula: see text] a successor ordinal, there exists a forcing notion in [Formula: see text] that preserves cardinals and forces that [Formula: see text] is [Formula: see text]-stationary, which implies that the consistency strength of the existence of a [Formula: see text]-stationary cardinal is strictly below a [Formula: see text]-indescribable cardinal. These results generalize to all successor ordinals [Formula: see text] the original same result of Mekler–Shelah [A. Mekler and S. Shelah, The consistency strength of every stationary set reflects, Israel J. Math. 67(3) (1989) 353–365] about a [Formula: see text]-stationary cardinal, i.e. a cardinal that reflects all its stationary sets.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"55 1","pages":"2050004"},"PeriodicalIF":0.9,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76158393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-03-04DOI: 10.1142/s0219061322500039
Logan Crone, Lior Fishman, Stephen Jackson
We introduce the notion of $(Gamma,E)$-determinacy for $Gamma$ a pointclass and $E$ an equivalence relation on a Polish space $X$. A case of particular interest is the case when $E=E_G$ is the (left) shift-action of $G$ on $S^G$ where $S=2={0,1}$ or $S=omega$. We show that for all shift actions by countable groups $G$, and any "reasonable" pointclass $Gamma$, that $(Gamma,E_G)$-determinacy implies $Gamma$-determinacy. We also prove a corresponding result when $E$ is a subshift of finite type of the shift map on $2^mathbb{Z}$.
{"title":"Equivalence relations and determinacy","authors":"Logan Crone, Lior Fishman, Stephen Jackson","doi":"10.1142/s0219061322500039","DOIUrl":"https://doi.org/10.1142/s0219061322500039","url":null,"abstract":"We introduce the notion of $(Gamma,E)$-determinacy for $Gamma$ a pointclass and $E$ an equivalence relation on a Polish space $X$. A case of particular interest is the case when $E=E_G$ is the (left) shift-action of $G$ on $S^G$ where $S=2={0,1}$ or $S=omega$. We show that for all shift actions by countable groups $G$, and any \"reasonable\" pointclass $Gamma$, that $(Gamma,E_G)$-determinacy implies $Gamma$-determinacy. We also prove a corresponding result when $E$ is a subshift of finite type of the shift map on $2^mathbb{Z}$.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"6 1","pages":"2250003:1-2250003:19"},"PeriodicalIF":0.9,"publicationDate":"2020-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86482900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-02-15DOI: 10.1142/s0219061321500057
Raphaël Carroy, B. D. Miller, Zolt'an Vidny'anszky
We generalize Kada’s definable strengthening of Dilworth’s characterization of the class of quasi-orders admitting an antichain of a given finite cardinality.
我们推广了Kada的可定义强化的Dilworth对一类允许给定有限基数的反链的拟序的刻画。
{"title":"On the existence of small antichains for definable quasi-orders","authors":"Raphaël Carroy, B. D. Miller, Zolt'an Vidny'anszky","doi":"10.1142/s0219061321500057","DOIUrl":"https://doi.org/10.1142/s0219061321500057","url":null,"abstract":"We generalize Kada’s definable strengthening of Dilworth’s characterization of the class of quasi-orders admitting an antichain of a given finite cardinality.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"8 1","pages":"2150005:1-2150005:10"},"PeriodicalIF":0.9,"publicationDate":"2020-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82342216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-08DOI: 10.1142/S0219061321500252
Will Johnson
We consider existentially closed fields with several orderings, valuations, and [Formula: see text]-valuations. We show that these structures are NTP2 of finite burden, but usually have the independence property. Moreover, forking agrees with dividing, and forking can be characterized in terms of forking in ACVF, RCF, and [Formula: see text]CF.
{"title":"Forking and dividing in fields with several orderings and valuations","authors":"Will Johnson","doi":"10.1142/S0219061321500252","DOIUrl":"https://doi.org/10.1142/S0219061321500252","url":null,"abstract":"We consider existentially closed fields with several orderings, valuations, and [Formula: see text]-valuations. We show that these structures are NTP2 of finite burden, but usually have the independence property. Moreover, forking agrees with dividing, and forking can be characterized in terms of forking in ACVF, RCF, and [Formula: see text]CF.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"24 1","pages":"2150025:1-2150025:43"},"PeriodicalIF":0.9,"publicationDate":"2020-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74963473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-12DOI: 10.1142/s0219061320500075
M. Zhukovskii
In 2001, Le Bars proved that there exists an existential monadic second-order (EMSO) sentence such that the probability that it is true on [Formula: see text] does not converge and conjectured that, for EMSO sentences with two first-order variables, the zero–one law holds. In this paper, we prove that the conjecture fails for [Formula: see text], and give new examples of sentences with fewer variables without convergence (even for [Formula: see text]).
{"title":"Logical laws for short existential monadic second-order sentences about graphs","authors":"M. Zhukovskii","doi":"10.1142/s0219061320500075","DOIUrl":"https://doi.org/10.1142/s0219061320500075","url":null,"abstract":"In 2001, Le Bars proved that there exists an existential monadic second-order (EMSO) sentence such that the probability that it is true on [Formula: see text] does not converge and conjectured that, for EMSO sentences with two first-order variables, the zero–one law holds. In this paper, we prove that the conjecture fails for [Formula: see text], and give new examples of sentences with fewer variables without convergence (even for [Formula: see text]).","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"22 1","pages":"2050007:1-2050007:23"},"PeriodicalIF":0.9,"publicationDate":"2019-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72525938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：