File:CardContin.svg
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 | 01:31, 25 June 2007 | | 30 × 22 (7 KB) | wikimediacommons>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 logic
- Ackermann ordinal
- Admissible set
- Algebraic definition
- Algebraic semantics (mathematical logic)
- Algorithmic logic
- Almost
- Aronszajn line
- Axiom of adjunction
- Axiom of finite choice
- Bachmann–Howard ordinal
- Beth definability
- Cabal (set theory)
- Centered set
- Chang's model
- Code (set theory)
- Coherent space
- Completeness of atomic initial sequents
- Computable isomorphism
- Computable ordinal
- Condensation lemma
- Continuous function (set theory)
- Continuum function
- Countryman line
- Critical point (set theory)
- Cyclic negation
- Diagram (mathematical logic)
- Elementary definition
- Elementary diagram
- Equisatisfiability
- Extendible cardinal
- Extension by new constant and function names
- Feferman–Schütte ordinal
- Finite character
- First-order reduction
- Gabbay's separation theorem
- Generic filter
- Gödel logic
- Hereditarily countable set
- High (computability)
- Homogeneous tree
- Homogeneously Suslin set
- Honest leftmost branch
- Inductive set
- International Workshop on First-Order Theorem Proving
- Iterable cardinal
- Jensen's covering theorem
- Knaster's condition
- Kuratowski's free set theorem
- Kurepa tree
- LEGO (proof assistant)
- Large Veblen ordinal
- Laver function
- Lightface analytic game
- Limited principle of omniscience
- Linked set
- Logic for Computable Functions
- Low (computability)
- Low basis theorem
- Lusin's separation theorem
- Martin's maximum
- Medvedev reducibility
- Modal collapse
- Multiverse (set theory)
- Mučnik reducibility
- Nested sequent calculus
- Omega-categorical theory
- Open formula
- Overlap (term rewriting)
- Pantachy
- Polyadic algebra
- Pseudo-intersection
- Quantifier rank
- Ramified forcing
- Random algebra
- Reduced product
- Robinson's joint consistency theorem
- Scattered order
- Set constraint
- Shrewd cardinal
- Small Veblen ordinal
- Square principle
- Strength (mathematical logic)
- Strong cardinal
- Successor function
- Superposition calculus
- Superstrong cardinal
- Suslin tree
- Takeuti's conjecture
- Tarski–Kuratowski algorithm
- Theory of pure equality
- Thousands of Problems for Theorem Provers
- Truth-table reduction
- UTM theorem
- Ulam matrix
- Unfoldable cardinal
- Universally Baire set
- Worldly cardinal
- Łoś–Tarski preservation theorem
View more links to this file.
