Size of this PNG preview of this SVG file:
30 × 22 pixels. Other resolutions:
320 × 235 pixels |
640 × 469 pixels |
1,024 × 751 pixels |
1,280 × 939 pixels |
2,560 × 1,877 pixels.
Original file (SVG file, nominally 30 × 22 pixels, file size: 7 KB)
 | This is a file from the
Wikimedia Commons. Information from its
description page there is shown below. Commons is a freely licensed media file repository. You can help. |
| Description |
two-to-the-aleph-null. For mathlogic-stub template. Comes from PNG rendering of LaTeX; (<math>2^{\aleph_0}</math>). |
| Date | |
| Source | en:Image:CardContin.png |
| Author | en:User:Trovatore, recreated by User:Stannered |
| Permission ( Reusing this file) |
PD/ineligible |
| Other versions | en:Image:CardContin.png |
|
This work is ineligible for copyright and therefore in the public domain because it consists entirely of information that is common property and contains no original authorship. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 00:31, 25 June 2007 |
| 30 × 22 (7 KB) | Stannered | {{Information |Description=two-to-the-aleph-null. For mathlogic-stub template. Comes from PNG rendering of LaTeX; <math>2^{\aleph_0}</math> (<code><nowiki><math>2^{\aleph_0}</math></nowiki></code>). |Source= en:Image:CardContin.png |Date=2007-06-25 |A |
File usage
More than 100 pages use this file. The following list shows the first 100 pages that use this file only. A full list is available.
- AD+
- Abstract structure
- Adequate pointclass
- Admissible ordinal
- Admissible set
- Algebraic semantics (mathematical logic)
- Almost
- Aronszajn line
- Axiom of projective determinacy
- Axiom of real determinacy
- Bachmann–Howard ordinal
- Bernays–Schönfinkel class
- Beth definability
- Cabal (set theory)
- Cantor–Dedekind axiom
- Categorical set theory
- Coanalytic set
- Cocountability
- Code (set theory)
- Coherent space
- Complete theory
- Computable isomorphism
- Computable measure theory
- Computable ordinal
- Continuous function (set theory)
- Continuum function
- Conull set
- Countryman line
- Critical point (set theory)
- Cyclic negation
- Deductive closure
- Diagonal intersection
- Difference hierarchy
- Effective descriptive set theory
- Erdős cardinal
- Extendible cardinal
- Extension (predicate logic)
- Extension by new constant and function names
- Finite character
- First-order reduction
- Generic filter
- Herbrand interpretation
- Hereditarily countable set
- Hierarchy (mathematics)
- High (computability)
- Homogeneous (large cardinal property)
- Homogeneous tree
- Homogeneously Suslin set
- Honest leftmost branch
- Inductive set
- Jónsson cardinal
- Kleene–Rosser paradox
- Kuratowski's free set theorem
- Kurepa tree
- Lightface analytic game
- Limitation of size
- Lindström's theorem
- Logic for Computable Functions
- Logical machine
- Low (computability)
- Low basis theorem
- Material nonimplication
- Maximal set
- Michael D. Morley
- Nice name
- Open formula
- Overlap (term rewriting)
- Paraconsistent mathematics
- Principle of distributivity
- Projection (set theory)
- Proof mining
- Ramified forcing
- Ramsey cardinal
- Reduced product
- Remarkable cardinal
- Robinson's joint consistency theorem
- Rowbottom cardinal
- Separating set
- Shelah cardinal
- Square principle
- Strong cardinal
- Strong partition cardinal
- Strongly compact cardinal
- Subclass (set theory)
- Subcompact cardinal
- Subtle cardinal
- Successor function
- Superposition calculus
- Superstrong cardinal
- Suslin cardinal
- Suslin representation
- Suslin tree
- Takeuti's conjecture
- Tarski–Kuratowski algorithm
- Tav (number)
- Truth-table reduction
- UTM theorem
- Unfoldable cardinal
- Vopěnka's principle
- Zero dagger
View more links to this file.
Global file usage
The following other wikis use this file:
- Usage on cv.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on ja.wikipedia.org
View more global usage of this file.
Size of this PNG preview of this SVG file:
30 × 22 pixels. Other resolutions:
320 × 235 pixels |
640 × 469 pixels |
1,024 × 751 pixels |
1,280 × 939 pixels |
2,560 × 1,877 pixels.
Original file (SVG file, nominally 30 × 22 pixels, file size: 7 KB)
| This is a file from the
Wikimedia Commons. Information from its
description page there is shown below. Commons is a freely licensed media file repository. You can help. |
| Description |
two-to-the-aleph-null. For mathlogic-stub template. Comes from PNG rendering of LaTeX; (<math>2^{\aleph_0}</math>). |
| Date | |
| Source | en:Image:CardContin.png |
| Author | en:User:Trovatore, recreated by User:Stannered |
| Permission ( Reusing this file) |
PD/ineligible |
| Other versions | en:Image:CardContin.png |
|
|
This work is ineligible for copyright and therefore in the public domain because it consists entirely of information that is common property and contains no original authorship. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 00:31, 25 June 2007 |
| 30 × 22 (7 KB) | Stannered | {{Information |Description=two-to-the-aleph-null. For mathlogic-stub template. Comes from PNG rendering of LaTeX; <math>2^{\aleph_0}</math> (<code><nowiki><math>2^{\aleph_0}</math></nowiki></code>). |Source= en:Image:CardContin.png |Date=2007-06-25 |A |
File usage
More than 100 pages use this file. The following list shows the first 100 pages that use this file only. A full list is available.
- AD+
- Abstract structure
- Adequate pointclass
- Admissible ordinal
- Admissible set
- Algebraic semantics (mathematical logic)
- Almost
- Aronszajn line
- Axiom of projective determinacy
- Axiom of real determinacy
- Bachmann–Howard ordinal
- Bernays–Schönfinkel class
- Beth definability
- Cabal (set theory)
- Cantor–Dedekind axiom
- Categorical set theory
- Coanalytic set
- Cocountability
- Code (set theory)
- Coherent space
- Complete theory
- Computable isomorphism
- Computable measure theory
- Computable ordinal
- Continuous function (set theory)
- Continuum function
- Conull set
- Countryman line
- Critical point (set theory)
- Cyclic negation
- Deductive closure
- Diagonal intersection
- Difference hierarchy
- Effective descriptive set theory
- Erdős cardinal
- Extendible cardinal
- Extension (predicate logic)
- Extension by new constant and function names
- Finite character
- First-order reduction
- Generic filter
- Herbrand interpretation
- Hereditarily countable set
- Hierarchy (mathematics)
- High (computability)
- Homogeneous (large cardinal property)
- Homogeneous tree
- Homogeneously Suslin set
- Honest leftmost branch
- Inductive set
- Jónsson cardinal
- Kleene–Rosser paradox
- Kuratowski's free set theorem
- Kurepa tree
- Lightface analytic game
- Limitation of size
- Lindström's theorem
- Logic for Computable Functions
- Logical machine
- Low (computability)
- Low basis theorem
- Material nonimplication
- Maximal set
- Michael D. Morley
- Nice name
- Open formula
- Overlap (term rewriting)
- Paraconsistent mathematics
- Principle of distributivity
- Projection (set theory)
- Proof mining
- Ramified forcing
- Ramsey cardinal
- Reduced product
- Remarkable cardinal
- Robinson's joint consistency theorem
- Rowbottom cardinal
- Separating set
- Shelah cardinal
- Square principle
- Strong cardinal
- Strong partition cardinal
- Strongly compact cardinal
- Subclass (set theory)
- Subcompact cardinal
- Subtle cardinal
- Successor function
- Superposition calculus
- Superstrong cardinal
- Suslin cardinal
- Suslin representation
- Suslin tree
- Takeuti's conjecture
- Tarski–Kuratowski algorithm
- Tav (number)
- Truth-table reduction
- UTM theorem
- Unfoldable cardinal
- Vopěnka's principle
- Zero dagger
View more links to this file.
Global file usage
The following other wikis use this file:
- Usage on cv.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on ja.wikipedia.org
View more global usage of this file.