{"title":"GCH下作为全局选择弱形式的序数连接公理","authors":"Rodrigo A. Freire, Peter Holy","doi":"10.1007/s00153-022-00838-2","DOIUrl":null,"url":null,"abstract":"<div><p>The minimal ordinal-connection axiom <span>\\(MOC\\)</span> was introduced by the first author in R. Freire. (South Am. J. Log. 2:347–359, 2016). We observe that <span>\\(MOC\\)</span> is equivalent to a number of statements on the existence of certain hierarchies on the universe, and that under global choice, <span>\\(MOC\\)</span> is in fact equivalent to the <span>\\({{\\,\\mathrm{GCH}\\,}}\\)</span>. Our main results then show that <span>\\(MOC\\)</span> corresponds to a weak version of global choice in models of the <span>\\({{\\,\\mathrm{GCH}\\,}}\\)</span>: it can fail in models of the <span>\\({{\\,\\mathrm{GCH}\\,}}\\)</span> without global choice, but also global choice can fail in models of <span>\\(MOC\\)</span>. \n\n</p></div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An ordinal-connection axiom as a weak form of global choice under the GCH\",\"authors\":\"Rodrigo A. Freire, Peter Holy\",\"doi\":\"10.1007/s00153-022-00838-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The minimal ordinal-connection axiom <span>\\\\(MOC\\\\)</span> was introduced by the first author in R. Freire. (South Am. J. Log. 2:347–359, 2016). We observe that <span>\\\\(MOC\\\\)</span> is equivalent to a number of statements on the existence of certain hierarchies on the universe, and that under global choice, <span>\\\\(MOC\\\\)</span> is in fact equivalent to the <span>\\\\({{\\\\,\\\\mathrm{GCH}\\\\,}}\\\\)</span>. Our main results then show that <span>\\\\(MOC\\\\)</span> corresponds to a weak version of global choice in models of the <span>\\\\({{\\\\,\\\\mathrm{GCH}\\\\,}}\\\\)</span>: it can fail in models of the <span>\\\\({{\\\\,\\\\mathrm{GCH}\\\\,}}\\\\)</span> without global choice, but also global choice can fail in models of <span>\\\\(MOC\\\\)</span>. \\n\\n</p></div>\",\"PeriodicalId\":48853,\"journal\":{\"name\":\"Archive for Mathematical Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archive for Mathematical Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00153-022-00838-2\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archive for Mathematical Logic","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00153-022-00838-2","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
An ordinal-connection axiom as a weak form of global choice under the GCH
The minimal ordinal-connection axiom \(MOC\) was introduced by the first author in R. Freire. (South Am. J. Log. 2:347–359, 2016). We observe that \(MOC\) is equivalent to a number of statements on the existence of certain hierarchies on the universe, and that under global choice, \(MOC\) is in fact equivalent to the \({{\,\mathrm{GCH}\,}}\). Our main results then show that \(MOC\) corresponds to a weak version of global choice in models of the \({{\,\mathrm{GCH}\,}}\): it can fail in models of the \({{\,\mathrm{GCH}\,}}\) without global choice, but also global choice can fail in models of \(MOC\).
期刊介绍:
The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.