{"title":"Hindman's theorem in the hierarchy of choice principles","authors":"David J. Fern'andez-Bret'on","doi":"10.1142/s0219061323500022","DOIUrl":"https://doi.org/10.1142/s0219061323500022","url":null,"abstract":"In the context of $mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various classical weak choice principles, thus precisely locating the strength of the statement as a weak form of the $mathsf{AC}$.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2022-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45407190","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}
{"title":"Coloring closed Noetherian graphs","authors":"J. Zapletal","doi":"10.1142/s0219061323500101","DOIUrl":"https://doi.org/10.1142/s0219061323500101","url":null,"abstract":"If [Formula: see text] is a closed Noetherian graph on a [Formula: see text]-compact Polish space with no infinite cliques, it is consistent with the choiceless set theory ZF[Formula: see text][Formula: see text][Formula: see text]DC that [Formula: see text] is countably chromatic and there is no Vitali set.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47044052","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}
{"title":"Valued fields with a total residue map","authors":"Konstantinos Kartas","doi":"10.1142/s0219061324500053","DOIUrl":"https://doi.org/10.1142/s0219061324500053","url":null,"abstract":"When $k$ is a finite field, Becker-Denef-Lipschitz (1979) observed that the total residue map $text{res}:k(!(t)!)to k$, which picks out the constant term of the Laurent series, is definable in the language of rings with a parameter for $t$. Driven by this observation, we study the theory $text{VF}_{text{res},iota}$ of valued fields equipped with a linear form $text{res}:Kto k$ which specializes to the residue map on the valuation ring. We prove that $text{VF}_{text{res},iota}$ does not admit a model companion. In addition, we show that the power series field $(k(!(t)!),text{res})$, equipped with such a total residue map, is undecidable whenever $k$ is an infinite field. As a consequence, we get that $(mathbb{C}(!(t)!), text{Res}_0)$ is undecidable, where $text{Res}_0:mathbb{C}(!(t)!)to mathbb{C}:fmapsto text{Res}_0(f)$ maps $f$ to its complex residue at $0$.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41293526","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}
{"title":"Structural reflection, shrewd cardinals and the size of the continuum","authors":"Philipp Lücke","doi":"10.1142/s0219061322500076","DOIUrl":"https://doi.org/10.1142/s0219061322500076","url":null,"abstract":"Motivated by results of Bagaria, Magidor and Väänänen, we study characterizations of large cardinal properties through reflection principles for classes of structures. More specifically, we aim to characterize notions from the lower end of the large cardinal hierarchy through the principle [Formula: see text] introduced by Bagaria and Väänänen. Our results isolate a narrow interval in the large cardinal hierarchy that is bounded from below by total indescribability and from above by subtleness, and contains all large cardinals that can be characterized through the validity of the principle [Formula: see text] for all classes of structures defined by formulas in a fixed level of the Lévy hierarchy. Moreover, it turns out that no property that can be characterized through this principle can provably imply strong inaccessibility. The proofs of these results rely heavily on the notion of shrewd cardinals, introduced by Rathjen in a proof-theoretic context, and embedding characterizations of these cardinals that resembles Magidor’s classical characterization of supercompactness. In addition, we show that several important weak large cardinal properties, like weak inaccessibility, weak Mahloness or weak [Formula: see text]-indescribability, can be canonically characterized through localized versions of the principle [Formula: see text]. Finally, the techniques developed in the proofs of these characterizations also allow us to show that Hamkin’s weakly compact embedding property is equivalent to Lévy’s notion of weak [Formula: see text]-indescribability.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86636755","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}
{"title":"Maximal models up to the first measurable in ZFC","authors":"J. Baldwin, S. Shelah","doi":"10.1142/s0219061322500118","DOIUrl":"https://doi.org/10.1142/s0219061322500118","url":null,"abstract":"Theorem: There is a complete sentence [Formula: see text] of [Formula: see text] such that [Formula: see text] has maximal models in a set of cardinals [Formula: see text] that is cofinal in the first measurable [Formula: see text] while [Formula: see text] has no maximal models in any [Formula: see text].","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41366898","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}
{"title":"Reducing ω-model reflection to iterated syntactic reflection","authors":"F. Pakhomov, J. Walsh","doi":"10.1142/s0219061322500015","DOIUrl":"https://doi.org/10.1142/s0219061322500015","url":null,"abstract":"","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82426554","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}
{"title":"The variety of projections of a tree-prikry forcing","authors":"Tom Benhamou, M. Gitik, Yair Hayut","doi":"10.1142/s0219061324500065","DOIUrl":"https://doi.org/10.1142/s0219061324500065","url":null,"abstract":"We study which $kappa$-distributive forcing notions of size $kappa$ can be embedded into tree Prikry forcing notions with $kappa$-complete ultrafilters under various large cardinal assumptions. An alternative formulation -- can the filter of dense open subsets of a $kappa$-distributive forcing notion of size $kappa$ be extended to a $kappa$-complete ultrafilter.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44382452","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}
{"title":"The two halves of disjunctive correctness","authors":"Cezary Cie'sli'nski, Mateusz Lelyk, Bartosz Wcislo","doi":"10.1142/s021906132250026x","DOIUrl":"https://doi.org/10.1142/s021906132250026x","url":null,"abstract":"Ali Enayat had asked whether two halves of Disjunctive Correctness (DC) for the compositional truth predicate are conservative over Peano Arithmetic. In this article, we show that the principle\"every true disjunction has a true disjunct\"is equivalent to bounded induction for the compositional truth predicate and thus it is not conservative. On the other hand, the converse implication\"any disjunction with a true disjunct is true\"can be conservatively added to PA. The methods introduced here allow us to give a direct nonconservativeness proof for DC.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76997177","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}
{"title":"Strongly Compact Cardinals and Ordinal Definability","authors":"G. Goldberg","doi":"10.1142/s0219061322500106","DOIUrl":"https://doi.org/10.1142/s0219061322500106","url":null,"abstract":"This paper explores several topics related to Woodin’s HOD conjecture. We improve the large cardinal hypothesis of Woodin’s HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a strongly compact cardinal and the HOD hypothesis holds, there is no elementary embedding from HOD to HOD, settling a question of Woodin. We show that the HOD hypothesis is equivalent to a uniqueness property of elementary embeddings of levels of the cumulative hierarchy. We prove that the HOD hypothesis holds if and only if every regular cardinal above the first strongly compact cardinal carries an ordinal definable ([Formula: see text])-Jónsson algebra. We show that if the HOD hypothesis holds and HOD satisfies the Ultrapower Axiom, then every supercompact cardinal is supercompact in HOD.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47681429","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}
{"title":"Coarse computability, the density metric, hausdorff distances between turing degrees, perfect trees, and reverse mathematics","authors":"D. Hirschfeldt, C. Jockusch, Jr., P. Schupp","doi":"10.1142/s0219061323500058","DOIUrl":"https://doi.org/10.1142/s0219061323500058","url":null,"abstract":"The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $delta$ on the space $mathcal{S}$ of coarse similarity classes defined by letting $delta([A],[B])$ be the upper density of the symmetric difference of $A$ and $B$. We study the resulting metric space, showing in particular that between any two distinct points there are continuum many geodesic paths. We also study subspaces of the form ${[A] : A in mathcal U}$ where $mathcal U$ is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of $mathcal U$. We then define a distance between Turing degrees based on Hausdorff distance in this metric space. We adapt a proof of Monin to show that the distances between degrees that occur are exactly 0, 1/2, and 1, and study which of these values occur most frequently in the senses of measure and category. We define a degree to be attractive if the class of all degrees at distance 1/2 from it has measure 1, and dispersive otherwise. We study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition. We also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of $(mathcal S,delta)$ from the perspectives of computability theory and reverse mathematics.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48787723","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号
