Ordinal definability and combinatorics of equivalence relations
Ordinal definability and combinatorics of equivalence relations
复制标题
等价关系的序数可定义性和组合数学
DOI:
10.1142/s0219061319500090
复制
发表时间:
2019
影响因子:
0.9
通讯作者:
Chan, William
中科院分区:
文献类型:
--
作者:
Chan, William
Assume. Letbe aequivalence relation coded in.has an ordinal definable equivalence class without any ordinal definable elements if and only ifis unpinned.proves-class section uniformization whenis aequivalence relation onwhich is pinned in every transitive model ofcontaining the real which codes: Supposeis a relation onsuch that each sectionis an-class, then there is a functionsuch that for all,.proves thatis Jónsson wheneveris an ordinal: For every function, there is anwithin bijection withand.
登录
查看更多内容
DOI:
--
发表时间:
2017
期刊:
影响因子:
--
作者:
William Chan;C. Meehan
通讯作者:
C. Meehan
影响因子:
0.6
作者:
V. Kanovei;V. Lyubetsky
通讯作者:
V. Lyubetsky
DOI:
--
发表时间:
1973
期刊:
影响因子:
--
作者:
K. Devlin
通讯作者:
K. Devlin
DOI:
--
发表时间:
2014
期刊:
影响因子:
--
作者:
S. Jackson;W. Woodin
通讯作者:
W. Woodin
DOI:
10.1016/0003-4843(73)90012-0
发表时间:
1973-07
期刊:
Annals of Mathematical Logic
影响因子:
--
作者:
A. Kechris
通讯作者:
A. Kechris