Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with infinite-combinatorics
Search options not deleted
user 109573
Combinatorial properties of infinite sets. This is a corner-point of set theory and combinatorics.
10
votes
Accepted
Can we make ZF − infinity + “all ordinals are finite” as strong as ZFC?
ZFfin implies every set is finite, and in particular choice holds. Suppose there is an infinite set $X.$ By replacing every element of $\mathcal{P}_{\text{fin}}(X)$ with its cardinality, we see $\omeg …
- 4,316