models of arithmetic;
resplendent models;
standard cut;
satisfaction classes;
AUTOMORPHISMS;
D O I:
10.1215/00294527-1716739
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We expand the notion of resplendency to theories of the kind T + p up arrow, where T is a first-order theory and p up arrow expresses that the type p is omitted; both T and p are in languages extending the base language. We investigate two different formulations and prove necessary and sufficient conditions for countable recursively saturated models of PA.
机构:
East China Normal Univ, Sch Math Sci, Key Lab MEA, Minist Educ, Shanghai 200241, Peoples R China
East China Normal Univ, Shanghai Key Lab PMMP, Shanghai 200241, Peoples R ChinaEast China Normal Univ, Sch Math Sci, Key Lab MEA, Minist Educ, Shanghai 200241, Peoples R China
Zhao, Jiuzhou
Li, Ruofan
论文数: 0引用数: 0
h-index: 0
机构:
Jinan Univ, Dept Math, Guangzhou 510632, Peoples R ChinaEast China Normal Univ, Sch Math Sci, Key Lab MEA, Minist Educ, Shanghai 200241, Peoples R China