Transplendent Models: Expansions Omitting a Type

被引:1
|
作者
Engstrom, Fredrik [1 ]
Kaye, Richard W. [2 ]
机构
[1] Gothenburg Univ, Dept Philosophy Linguist & Theory Sci, S-40530 Gothenburg, Sweden
[2] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England
关键词
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.
引用
收藏
页码:413 / 428
页数:16
相关论文
共 50 条