Image:CardContin.svg
From Wikipedia, the free encyclopedia
CardContin.svg (SVG file, nominally 30 × 22 pixels, file size: 7 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
| Description |
two-to-the-aleph-null. For mathlogic-stub template. Comes from PNG rendering of LaTeX; |
|---|---|
| Source | |
| Date |
2007-06-25 |
| Author |
en:User:Trovatore, recreated by User:Stannered |
| Permission (Reusing this image) |
PD/ineligible |
| Other versions | en:Image:CardContin.png |
(
 |
This image 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.
العربية | Afrikaans | Български | Bosanski | Česky | Dansk | Deutsch | English | Esperanto | Español | Français | हिन्दी | Italiano | 日本語 | 한국어 | Magyar | Nederlands | Norsk (nynorsk) | Polski | Português | Русский | Svenska | Türkçe | 中文(繁體) | 中文(简体) | +/- |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | 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 links
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):
- Star height problem
- Infinite set
- Church–Rosser theorem
- Totally indescribable cardinal
- Strong cardinal
- Woodin cardinal
- Superstrong cardinal
- Supercompact cardinal
- Huge cardinal
- Ineffable cardinal
- Extensionality
- Order isomorphism
- Rank-into-rank
- Extendible cardinal
- Ramsey cardinal
- Erdős cardinal
- Subtle cardinal
- Set-theoretic limit
- Gimel function
- Axiom of countable choice
- Shelah cardinal
- Weakly hyper-Woodin cardinal
- Hyper-Woodin cardinal
- Remarkable cardinal
- NTIME
- NE (complexity)
- Generalized star height problem
- Unfoldable cardinal
- Coherent space
- Elementary embedding
- Lindenbaum–Tarski algebra
- Maximal consistent set
- Rank (set theory)
- Paraconsistent mathematics
- Axiom of real determinacy
- Kleene fixpoint theorem
- PCF theory
- Projective hierarchy
- Axiom of projective determinacy
- Mostowski collapse lemma
- PSPACE-hard
- Finite thickness
- Supercombinator
- Stuttering equivalence
- Rabin automaton
- Fréchet filter
- Cantor-Dedekind axiom
- Diagonal intersection
- Skolem hull
- Weighted context-free grammar
- Borel equivalence relation
- Quantifier elimination
- Internal set
- Generic filter
- Cabal (set theory)
- Global square
- Takeuti conjecture
- Transitive set
- Epsilon-induction
- Heyting arithmetic
- Set system of finite character
- Inductive set (axiom of infinity)
- Inductive set
- Lightface analytic game
- Truth table reduction
- Template:Mathlogic-stub
- Tarski–Kuratowski algorithm
- Θ (set theory)
- AD+
- Hartogs number
- Characteristic sequence
- MAX-3SAT(13)
- Effective descriptive set theory
- Rowbottom cardinal
- Set-theoretic topology
- Mouse (set theory)
- Hereditary set
- Difference hierarchy
- Sudan function
- Extension (predicate logic)
- Krull's theorem
- Limitation of size
- Coanalytic set
- Trakhtenbrot's theorem
- Singular cardinal hypothesis
- Admissible ordinal
- PLS (complexity)
- LOGCFL
- Critical point (set theory)
- Star-free language
- Normal measure
- Critical pair
- Hereditarily countable set
- Code (set theory)
- Axiom of global choice
- Axiom of limitation of size
- Continuum function
- Ineffably Ramsey cardinal
- Homogeneous (large cardinal property)
- Bernays–Schönfinkel class
View more links to this file.
