Image:CardContin.png
From Wikipedia, the free encyclopedia
No higher resolution available.
CardContin.png (30 × 22 pixel, file size: 555 B, MIME type: image/png)
[edit] Summary
two-to-the-aleph-null. For mathlogic-stub template. Comes from PNG rendering of LaTeX; (<math>2^{\aleph_0}</math>
). Copied from a WP article
[edit] Licensing
|
File history
Legend: (cur) = this is the current file, (del) = delete
this old version, (rev) = revert to this old version.
Click on date to download the file or see the image uploaded on that date.
- (del) (cur) 07:23, 23 March 2006 . . Trovatore (Talk | contribs) . . 30×22 (555 bytes) (Previous version plus green border)
- (del) (rev) 18:06, 4 October 2005 . . Trovatore (Talk | contribs) . . 28×20 (335 bytes) (two-to-the-aleph-naught. For mathlogic-stub template. Comes from PNG rendering of LaTeX. Copied from a WP article, so automatically GFDL)
- Edit this file using an external application
See the setup instructions for more information.
File links
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):
- Biconditional introduction
- Biconditional elimination
- Conditional proof
- Conjunction introduction
- Conjunction elimination
- Disjunction elimination
- First-order predicate
- Second-order predicate
- Infinite set
- Ultrafinitism
- Church–Rosser theorem
- Finitism
- Domain of discourse
- Direct proof
- Totally indescribable cardinal
- Strong cardinal
- Woodin cardinal
- Superstrong cardinal
- Supercompact cardinal
- Huge cardinal
- Ineffable cardinal
- Logical assertion
- Universal set
- Herbrand universe
- Extendible cardinal
- Ramsey cardinal
- Erdős cardinal
- Subtle cardinal
- Gimel function
- Game of logic
- Metalogic
- Descriptive set theory
- Nonstandard model
- Skolem normal form
- Axiom of countable choice
- Shelah cardinal
- Weakly hyper-Woodin cardinal
- Hyper-Woodin cardinal
- Remarkable cardinal
- B,C,K,W system
- Negation normal form
- Higher-order logic
- Coq
- Interpretability
- Polysyllogism
- Löb's theorem
- Strict logic
- Hybrid logic
- Simplification (logic)
- Unfoldable cardinal
- Lambda cube
- Normal modal logic
- Proof net
- Coherent space
- Atomic sentence
- Elementary embedding
- Lindenbaum–Tarski algebra
- Analytic proof
- Self-verifying theories
- Positive set theory
- Defuzzification
- Algebraic normal form
- T-schema
- Maximal consistent set
- Non-well-founded set theory
- Axiom of real determinacy
- Independence (mathematical logic)
- Horn-satisfiability
- PCF theory
- Projective hierarchy
- Axiom of projective determinacy
- Calculus of structures
- Deep inference
- Proof calculus
- Mostowski collapse lemma
- Carine theorem prover
- Existential proposition
- Interval temporal logic
- Object theory
- Propositional variable
- Universal instantiation
- Fréchet filter
- Cantor-Dedekind axiom
- Proof procedure
- Herbrand base
- Skolem hull
- Conservative extension
- Impredicativity
- Finitistic induction
- The Laws of Thought
- O-minimality
- Submodel
- Craig interpolation
- Conservativity theorem
- Borel equivalence relation
- Sentence (mathematical logic)
- Counting quantification
- Empty domain
- Internal set
- Generic filter
- Herbrand theory
- Cabal (set theory)
- Global square
- User talk:LarryLACa
- Takeuti conjecture
- Transitive set
- Epsilon-induction
- Herbrand's theorem (proof theory)
- Heyting arithmetic
- Inductive set (axiom of infinity)
- Inductive set
- Lightface analytic game
- Truth table reduction
- Template:Mathlogic-stub
- Tarski–Kuratowski algorithm
- Θ (set theory)
- AD+
- Fluent calculus
- Hartogs number
- Boolean grammar
- Effective descriptive set theory
- Rowbottom cardinal
- Kruskal's tree theorem
- Set-theoretic topology
- Finitary boolean function
- Multiple-conclusion logic
- Mouse (set theory)
- Extension (model theory)
- Inner model theory
- Modal operator
- Difference hierarchy
- Sudan function
- Tacit extension
- Gentzen's consistency proof
- Logical constant
- Logical matrix
- Krull's theorem
- Multigrade operator
- Limitation of size
- Coanalytic set
- Formula (mathematical logic)
- Trakhtenbrot's theorem
- Wadge hierarchy
- Singular cardinal hypothesis
- Admissible ordinal
- Easton's theorem
- Frege's theorem
- Critical point (set theory)
- Normal measure
- Critical pair
- Hereditarily countable set
- Code (set theory)
- Functional completeness
- Axiom of global choice
- Axiom of limitation of size
- Continuum function
- Bar induction
- Neighborhood semantics
- Transparent Intensional Logic
- Ineffably Ramsey cardinal
- Homogeneous (large cardinal property)
- Bernays–Schönfinkel class
- Ordinal notation
- Mu calculus
- Non-standard arithmetic
- CTL*
- Almost ineffable cardinal
- Lindenbaum's lemma
- Matita proof assistant
- Indexed language
- Lindström's theorem
- Suslin cardinal
- Lambda-Suslin
- Branch (graph theory)
- Literal (mathematical logic)
- Apartness relation
- Institutional model theory
- Algebraic logic
- Premise (mathematics)
- Lindström quantifier
- Delta lemma
- Contraposition
- Aczel's anti-foundation axiom
- Effectively calculable
- Kleene–Brouwer order
- Homogeneously Suslin set
- Homogeneous tree
- Corresponding conditional (logic)
- Implication graph
- Low (computability)
- High (computability)
- Low basis theorem
- Complete theory
- Zero dagger
- Adequate pointclass