- Subcountability
In
constructive mathematics , a collection is subcountable if there exists a partialsurjection from thenatural 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 classicalset theory , where a set is subcountable if and only if it isfinite orcountably infinite . Constructively it is consistent to assert the subcountability of some uncountable collections such as thereal numbers . Indeed there are models of theconstructive set theory CZF in which "all" sets are subcountable [Rathjen, M. " [http://www.maths.leeds.ac.uk/pure/staff/rathjen/acend.pdf Choice principles in constructive and classical set theories] ", Proceedings of the Logic Colloquium, 2002] and models of IZF in which all sets withapartness relation s are subcountable [McCarty, J. " [http://meh.org Subcountability under realizability] ", Notre Dame Journal of Formal Logic, Vol 27 no 2 April 1986] .References
Wikimedia Foundation. 2010.