Zfc Proves that the class of Ordinals is not Weakly Compact for Definable Classes
暂无分享,去创建一个
[1] F. Stephan,et al. Set theory , 2018, Mathematical Statistics with Applications in R.
[2] Carl G. Jockusch,et al. Ramsey's theorem and recursion theory , 1972, Journal of Symbolic Logic.
[3] Jon Barwise,et al. Admissible sets and structures , 1975 .
[4] Matt Kaufmann,et al. Blunt and topless end extensions of models of set theory , 1983, Journal of Symbolic Logic.
[5] Hao Wang. Popular Lectures on Mathematical Logic. , 1984 .
[6] Amir Leshem. On The Consistency of The Definable Tree Property on Alef-Symbol1 , 2000, J. Symb. Log..
[7] Einar W. Høst,et al. Doctoral Dissertation , 1956, Church History.
[8] Ulrich Felgner. Choice Functions on Sets and Classes , 1976 .
[9] Petr Hájek,et al. Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.
[10] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[11] Charles Parsons. Sets and Classes , 1974 .
[12] Ali Enayat. On certain elementary extensions of models of set theory , 1984 .
[13] A. Mostowski. Some impredicative definitions in the axiomatic set theory , 1950 .
[14] Ali Enayat. Power-Like Models of Set Theory , 2001, J. Symb. Log..
[15] William B. Easton,et al. Powers of regular cardinals , 1970 .