{"title":"关于算术模型末端扩展的考夫曼--克洛特问题和弱正则原则","authors":"Mengzhou Sun","doi":"arxiv-2409.03527","DOIUrl":null,"url":null,"abstract":"We investigate the end extendibility of models of arithmetic with restricted\nelementarity. By utilizing the restricted ultrapower construction in the\nsecond-order context, for each $n\\in\\mathbb{N}$ and any countable model of\n$\\mathrm{B}\\Sigma_{n+2}$, we construct a proper $\\Sigma_{n+2}$-elementary end\nextension satisfying $\\mathrm{B}\\Sigma_{n+1}$, which answers a question by\nClote positively. We also give a characterization of countable models of\n$\\mathrm{I}\\Sigma_{n+2}$ in terms of their end extendibility similar to the\ncase of $\\mathrm{B}\\Sigma_{n+2}$. Along the proof, we will introduce a new type\nof regularity principles in arithmetic called the weak regularity principle,\nwhich serves as a bridge between the model's end extendibility and the amount\nof induction or collection it satisfies.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Kaufmann--Clote question on end extensions of models of arithmetic and the weak regularity principle\",\"authors\":\"Mengzhou Sun\",\"doi\":\"arxiv-2409.03527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the end extendibility of models of arithmetic with restricted\\nelementarity. By utilizing the restricted ultrapower construction in the\\nsecond-order context, for each $n\\\\in\\\\mathbb{N}$ and any countable model of\\n$\\\\mathrm{B}\\\\Sigma_{n+2}$, we construct a proper $\\\\Sigma_{n+2}$-elementary end\\nextension satisfying $\\\\mathrm{B}\\\\Sigma_{n+1}$, which answers a question by\\nClote positively. We also give a characterization of countable models of\\n$\\\\mathrm{I}\\\\Sigma_{n+2}$ in terms of their end extendibility similar to the\\ncase of $\\\\mathrm{B}\\\\Sigma_{n+2}$. Along the proof, we will introduce a new type\\nof regularity principles in arithmetic called the weak regularity principle,\\nwhich serves as a bridge between the model's end extendibility and the amount\\nof induction or collection it satisfies.\",\"PeriodicalId\":501306,\"journal\":{\"name\":\"arXiv - MATH - Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.03527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.03527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Kaufmann--Clote question on end extensions of models of arithmetic and the weak regularity principle
We investigate the end extendibility of models of arithmetic with restricted
elementarity. By utilizing the restricted ultrapower construction in the
second-order context, for each $n\in\mathbb{N}$ and any countable model of
$\mathrm{B}\Sigma_{n+2}$, we construct a proper $\Sigma_{n+2}$-elementary end
extension satisfying $\mathrm{B}\Sigma_{n+1}$, which answers a question by
Clote positively. We also give a characterization of countable models of
$\mathrm{I}\Sigma_{n+2}$ in terms of their end extendibility similar to the
case of $\mathrm{B}\Sigma_{n+2}$. Along the proof, we will introduce a new type
of regularity principles in arithmetic called the weak regularity principle,
which serves as a bridge between the model's end extendibility and the amount
of induction or collection it satisfies.