λ完备μ +$ \mu ^+$ -c的强迫公理。

IF 0.4 4区数学 Q4 LOGIC

Mathematical Logic Quarterly Pub Date : 2022-02-03 DOI:10.1002/malq.201900020

Saharon Shelah

{"title":"λ完备μ +$ \\mu ^+$ -c的强迫公理。","authors":"Saharon Shelah","doi":"10.1002/malq.201900020","DOIUrl":null,"url":null,"abstract":"<p>We consider forcing axioms for suitable families of μ-complete <math>\n <semantics>\n <msup>\n <mi>μ</mi>\n <mo>+</mo>\n </msup>\n <annotation>$\\mu ^+$</annotation>\n </semantics></math>-c.c. forcing notions. We show that some form of the condition “<math>\n <semantics>\n <mrow>\n <msub>\n <mi>p</mi>\n <mn>1</mn>\n </msub>\n <mo>,</mo>\n <msub>\n <mi>p</mi>\n <mn>2</mn>\n </msub>\n </mrow>\n <annotation>$p_1,p_2$</annotation>\n </semantics></math> have a <math>\n <semantics>\n <mrow>\n <msub>\n <mo>≤</mo>\n <mi>Q</mi>\n </msub>\n <mi>-</mi>\n <mi>lub</mi>\n </mrow>\n <annotation>$\\le _{{\\mathbb {Q}}}\\text{-}{\\rm lub}$</annotation>\n </semantics></math> in <math>\n <semantics>\n <mi>Q</mi>\n <annotation>${\\mathbb {Q}}$</annotation>\n </semantics></math>” is necessary. We also show some versions are really stronger than others.</p>","PeriodicalId":49864,"journal":{"name":"Mathematical Logic Quarterly","volume":"68 1","pages":"6-26"},"PeriodicalIF":0.4000,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Forcing axioms for λ-complete \\n \\n \\n μ\\n +\\n \\n $\\\\mu ^+$\\n -c.c.\",\"authors\":\"Saharon Shelah\",\"doi\":\"10.1002/malq.201900020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We consider forcing axioms for suitable families of μ-complete <math>\\n <semantics>\\n <msup>\\n <mi>μ</mi>\\n <mo>+</mo>\\n </msup>\\n <annotation>$\\\\mu ^+$</annotation>\\n </semantics></math>-c.c. forcing notions. We show that some form of the condition “<math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>p</mi>\\n <mn>1</mn>\\n </msub>\\n <mo>,</mo>\\n <msub>\\n <mi>p</mi>\\n <mn>2</mn>\\n </msub>\\n </mrow>\\n <annotation>$p_1,p_2$</annotation>\\n </semantics></math> have a <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mo>≤</mo>\\n <mi>Q</mi>\\n </msub>\\n <mi>-</mi>\\n <mi>lub</mi>\\n </mrow>\\n <annotation>$\\\\le _{{\\\\mathbb {Q}}}\\\\text{-}{\\\\rm lub}$</annotation>\\n </semantics></math> in <math>\\n <semantics>\\n <mi>Q</mi>\\n <annotation>${\\\\mathbb {Q}}$</annotation>\\n </semantics></math>” is necessary. We also show some versions are really stronger than others.</p>\",\"PeriodicalId\":49864,\"journal\":{\"name\":\"Mathematical Logic Quarterly\",\"volume\":\"68 1\",\"pages\":\"6-26\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2022-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Logic Quarterly\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/malq.201900020\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Logic Quarterly","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/malq.201900020","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"LOGIC","Score":null,"Total":0}

引用次数: 0

摘要

我们考虑了μ-完备μ + $\mu ^+$ -c.c.强迫概念的合适族的强迫公理。我们证明了某种形式的条件p 1，p2 $p_1,p_2$有一个≤Q - lub $\le _{{\mathbb {Q}}}\text{-}{\rm lub}$在Q ${\mathbb {Q}}$”是必要的。我们还展示了一些版本确实比其他版本更强大。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Forcing axioms for λ-complete μ + $\mu ^+$ -c.c.

We consider forcing axioms for suitable families of μ-complete $μ^{+}$ -c.c. forcing notions. We show that some form of the condition “ $p_{1}, p_{2}$ have a $\leq_{Q} - lub$ in $Q$ ” is necessary. We also show some versions are really stronger than others.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Mathematical Logic Quarterly 数学-数学

CiteScore

0.60

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Mathematical Logic Quarterly publishes original contributions on mathematical logic and foundations of mathematics and related areas, such as general logic, model theory, recursion theory, set theory, proof theory and constructive mathematics, algebraic logic, nonstandard models, and logical aspects of theoretical computer science.