Mathematical logic and foundations Ordinals and cardinals Concept
Countable set
Summary
A countable set is a set whose elements can be listed in a finite or infinite sequence. It is finite or equinumerous with the natural numbers.
Where this leads
25 pages build on this one.
- Perfect set property
- Ordinal analysis
- Skolem's paradox
- Null set
- Omitting types theorem
- G-delta set
- Hausdorff paradox
- Sigma-compact space
- Proof-theoretic ordinal
- Ordinal analysis
- Proof-theoretic ordinal
- Sigma-finite measure
- Ulm's theorem
- Integral operator
- Countably compact space
- Fraïssé limit
- Countably generated structure
- Epsilon nought
- Gentzen's consistency proof
- Cantor algebra
- Tennenbaum's theorem
- Fundamental domain
- Vitali set
- F-sigma set
- Vaught conjecture
Further reading
- Web https://en.wikipedia.org/wiki/Countable_set, lead section
About this page
| Tag | 01TQB88H4C |
|---|---|
| URI | m2://01TQB88H4C |
| Aliases | at-most-countable, denumerable-or-finite |
| Kind | concept |
| Writing | W1 stated |
| MSC | 03E10 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Special cases
Definitions
Used by
- Perfect set property
- Skolem's paradox
- Null set
- Omitting types theorem
- G-delta set
- Hausdorff paradox
- Sigma-compact space
- Sigma-finite measure
- Ulm's theorem
- Countably compact space
- Fraïssé limit
- Countably generated structure
- Epsilon nought
- Cantor algebra
- Tennenbaum's theorem
- Fundamental domain
- Vitali set
- F-sigma set
- Vaught conjecture