| http://www.w3.org/ns/prov#value | - In particular, a set is countable if there is a function such that every has finitely many preimages.??? (This means that for every there are only finitely many with .) This follows because we can define to be , and then we have expressed as a countable union of finite sets.
|