• unconditionally impossible. We conclude that the subcountability axiom, asserting all sets are subcountable, is incompatible with P N {\displaystyle {\mathcal...
    22 KB (3,589 words) - 21:28, 12 May 2025
  • Thumbnail for Cantor's diagonal argument
    axiom of powerset is not adopted, in a constructive framework even the subcountability of all sets is then consistent. That all said, in common set theories...
    27 KB (2,751 words) - 02:16, 12 April 2025
  • Markovian school is the permitted subcountability of various uncountable collections. When adopting the subcountability of the collection of all unending...
    213 KB (35,220 words) - 20:43, 9 May 2025
  • Thumbnail for Computable number
    countably many Turing machines, showing that the computable numbers are subcountable. The set S {\displaystyle S} of these Gödel numbers, however, is not...
    24 KB (3,269 words) - 15:29, 19 February 2025
  • {\displaystyle \leq } on corresponding cardinals. Homological algebra Subcountable Griess, Robert L. (1982), "The Friendly Giant", Inventiones Mathematicae...
    7 KB (842 words) - 18:17, 2 December 2024
  • {Q} }^{\mathbb {N} }} or some models of the reals can be taken to be subcountable. That said, Cantors diagonal construction proving uncountability of powersets...
    31 KB (4,955 words) - 15:47, 1 February 2025