翻訳と辞書 |
Subcountability : ウィキペディア英語版 | Subcountability In constructive mathematics, a collection is subcountable if there exists a partial surjection from the natural numbers onto it. The name derives from the intuitive sense that such a collection is "no bigger" than the counting numbers. The concept is trivial in classical set theory, where a set is subcountable if and only if it is finite or countably infinite. Constructively it is consistent to assert the subcountability of some uncountable collections such as the real numbers. Indeed there are models of the constructive set theory CZF in which ''all'' sets are subcountable〔Rathjen, M. "(Choice principles in constructive and classical set theories )", Proceedings of the Logic Colloquium, 2002〕 and models of IZF in which all sets with apartness relations are subcountable.〔McCarty, J. "(Subcountability under realizability )", Notre Dame Journal of Formal Logic, Vol 27 no 2 April 1986〕 == References == 〔
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Subcountability」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|