go-v.orgcodex
Menu
Page tools

codex · Philosophy

Subcountability

In constructive mathematics, a collection X is subcountable if there exists a partial surjection from the natural numbers onto it. This may be expressed as ∃(I⊆ℕ).∃f.(f:I↠X), where f:I↠X denotes that f is a surjective function from I onto X. The surjection is a member of ℕ⇀X and here the subclass I of ℕ is required to be a set. In other words, all elements of a subcountable collection X are functionally in the image of an indexing set of counting numbers I⊆ℕ and thus the set X can be understood as being dominated by the countable set ℕ.

Wikipedia contributors, "Subcountability", Wikipedia, revision 1353262140, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex