More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic

被引：0
|
作者：
Schmerl, James H. [1 ]
机构：
[1] Univ Connecticut, Dept Math, Storrs, CT 06269 USA
来源：
NOTRE DAME JOURNAL OF FORMAL LOGIC | 2018年 / 59卷 / 04期
关键词：
Peano Arithmetic; Thin Set Theorem; automorphisms; arithmetic saturation;
D O I：
10.1215/00294527-2018-0009
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
There is an infinite set T of Turing-equivalent completions of Peano Arithmetic (PA) such that whenever M and N are nonisomorphic countable, arithmetically saturated models of PA and Th(M), Th(N) is an element of T, then Aut(M) congruent to Aut(N).
引用
收藏
页码：491 / 496
页数：6
相关论文
共 50 条
12345