PA的模型:不含极小超滤子的标准系统
Models of PA: Standard Systems without Minimal Ultrafilters
摘要:
我们证明,粗体N,算术的标准模型,有一个不可数的基本扩展N,这样就没有超滤子的布尔代数的子集表示在N中的粗体N是最小的(即在Rudin-Keisler顺序表示在N中的分区)。
英文摘要:
We prove that bold N, the standard model of arithmetic, has an uncountable elementary extension N such that there is no ultrafilter on the Boolean Algebra of subsets of bold N represented in N which is minimal (i.e. as in Rudin-Keisler order for partitions represented in N).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。