Subcountability
http://dbpedia.org/resource/Subcountability
In constructive mathematics, a collection is subcountable if there exists a partial surjection from the natural numbers onto it.This may be expressed as where denotes that is a surjective function from a onto . The surjection is a member of and here the subclass of is required to be a set.In other words, all elements of a subcountable collection are functionally in the image of an indexing set of counting numbers and thus the set can be understood as being dominated by the countable set .
rdf:langString
rdf:langString
Subcountability
xsd:integer
15036487
xsd:integer
1115945123
rdf:langString
In constructive mathematics, a collection is subcountable if there exists a partial surjection from the natural numbers onto it.This may be expressed as where denotes that is a surjective function from a onto . The surjection is a member of and here the subclass of is required to be a set.In other words, all elements of a subcountable collection are functionally in the image of an indexing set of counting numbers and thus the set can be understood as being dominated by the countable set . Note that nomenclature of countability and finiteness properties vary substantially, historically. The discussion here concerns the property defined in terms of surjections onto the set in question.
xsd:nonNegativeInteger
20567