Provident sets and rudimentary set forcing

被引:11
作者
Mathias, A. R. D. [1 ]
机构
[1] Univ Reunion, ERMIT, St Denis, Reunion, France
关键词
rudimentary recursion; provident set; forcing; gentle separation; progress; provident closure; nominator; RECURSION;
D O I
10.4064/fm230-2-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Using the theory of rudimentary recursion and provident sets expounded in [MB], we give a treatment of set forcing appropriate for working over models of a theory PROVI which may plausibly claim to be the weakest set theory supporting a smooth theory of set forcing, and of which the minimal model is Jensen's J(omega). Much of the development is rudimentary or at worst given by rudimentary recursions with parameter the notion of forcing under consideration. Our development eschews the power set axiom. We show that the forcing relation for Delta(0) wffs is propagated through our hierarchies by a rudimentary function, and we show that the construction of names for the values of rudimentary and rudimentarily recursive functions is similarly propagated. Our main result is that a set-generic extension of a provident set is provident.
引用
收藏
页码:99 / 148
页数:50
相关论文
共 33 条
[1]  
[Anonymous], FUND MATH
[2]  
Barwise KJ., 1975, ADMISSIBLE SETS STRU, DOI 10.1007/978-3-662-11035-5
[3]   On the conservativity of the axiom of choice over set theory [J].
Carlson, Timothy J. .
ARCHIVE FOR MATHEMATICAL LOGIC, 2011, 50 (7-8) :777-790
[4]   FORCING FOR IMPREDICATIVE THEORY OF CLASSES [J].
CHUAQUI, R .
JOURNAL OF SYMBOLIC LOGIC, 1972, 37 (01) :1-&
[5]  
Devlin KeithJ., 1984, Perspectives in Mathematical Logic
[6]   UNCOUNTABLE ADMISSIBLES - I - FORCING [J].
FRIEDMAN, SD .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1982, 270 (01) :61-73
[7]  
FRIEDMAN SD, 1986, STUDIES LOGIC FDN MA, V0114, P00129
[8]  
GANDY RO, 1974, P S PURE MATH, V13, P103
[9]   Generic relativizations of fine structure [J].
Hauser, K .
ARCHIVE FOR MATHEMATICAL LOGIC, 2000, 39 (04) :227-249
[10]  
Jensen R.B., 1971, AXIOMATIC SET THEORY, VXIII, P143