{"title":"Normalizing notations in the Ershov hierarchy","authors":"Cheng Peng","doi":"10.1002/malq.202100004","DOIUrl":"https://doi.org/10.1002/malq.202100004","url":null,"abstract":"<p>The Turing degrees of infinite levels of the Ershov hierarchy were studied by Liu and Peng [8]. In this paper, we continue the study of Turing degrees of infinite levels and lift the study of density property to the levels beyond ω<sup>2</sup>. In doing so, we rely on notations with some nice properties. We introduce the concept of normalizing notations and generate normalizing notations for higher levels. The generalizations of the weak density theorem and the nondensity theorem are proved for higher levels in the Ershov hierarchy. Furthermore, we also investigate the minimal degrees in the infinite levels of the Ershov hierarchy.</p>","PeriodicalId":49864,"journal":{"name":"Mathematical Logic Quarterly","volume":"67 4","pages":"506-513"},"PeriodicalIF":0.3,"publicationDate":"2021-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72362540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MA\u0000 (\u0000 \u0000 ℵ\u0000 0\u0000 \u0000 )\u0000 restricted to complete Boolean algebras and choice","authors":"Eleftherios Tachtsis","doi":"10.1002/malq.202000031","DOIUrl":"https://doi.org/10.1002/malq.202000031","url":null,"abstract":"<p>It is a long standing open problem whether or not the Axiom of Countable Choice implies the fragment <math>\u0000 <mrow>\u0000 <mi>MA</mi>\u0000 <mo>(</mo>\u0000 <msub>\u0000 <mi>ℵ</mi>\u0000 <mn>0</mn>\u0000 </msub>\u0000 <mo>)</mo>\u0000 </mrow></math> of Martin's Axiom either in <math>\u0000 <mi>ZFA</mi></math> or in <math>\u0000 <mi>ZF</mi></math>. In this direction, we provide a partial answer by establishing that the Boolean Prime Ideal Theorem in conjunction with the Countable Union Theorem does not imply <math>\u0000 <mrow>\u0000 <mi>MA</mi>\u0000 <mo>(</mo>\u0000 <msub>\u0000 <mi>ℵ</mi>\u0000 <mn>0</mn>\u0000 </msub>\u0000 <mo>)</mo>\u0000 </mrow></math> restricted to complete Boolean algebras in <math>\u0000 <mi>ZF</mi></math>. Furthermore, we prove that the latter (formally) weaker form of <math>\u0000 <mrow>\u0000 <mi>MA</mi>\u0000 <mo>(</mo>\u0000 <msub>\u0000 <mi>ℵ</mi>\u0000 <mn>0</mn>\u0000 </msub>\u0000 <mo>)</mo>\u0000 </mrow></math> and the Δ-system Lemma are independent of each other in <math>\u0000 <mi>ZFA</mi></math>.</p><p>We also answer open questions from Tachtsis [16] which concern the status of <math>\u0000 <mrow>\u0000 <mi>MA</mi>\u0000 <mo>(</mo>\u0000 <msub>\u0000 <mi>ℵ</mi>\u0000 <mn>0</mn>\u0000 </msub>\u0000 <mo>)</mo>\u0000 </mrow></math> restricted to complete Boolean algebras in certain Fraenkel–Mostowski permutation models of <math>\u0000 <mi>ZFA</mi></math> and we strengthen some results from the above paper.</p>","PeriodicalId":49864,"journal":{"name":"Mathematical Logic Quarterly","volume":"67 4","pages":"420-431"},"PeriodicalIF":0.3,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72361979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}