| http://www.w3.org/ns/prov#value | - it is true that a set is said to be countable if there is a bijection to a subset of N, and as N is countably infinite again by definition, and as N is always a subset of N, the bijection you refer to may or may not imply a set is countably infinite, it could easily be finite (we do not need the countably bit for finite sets).
|
