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 |
forcing, large cardinals, descriptive set theory, infinite combinatorics, cardinal characteristics, forcing axioms, ultrapowers, measures, reflection, pcf theory, models of set theory, axioms of set theory, independence, axiom of choice, continuum hypothesis, determinacy, Borel equivalence relations, Boolean-valued models, embeddings, orders, relations, transfinite recursion, set theory as a foundation of mathematics, the philosophy of set theory.
5
votes
Accepted
Subsets of $\mathbb{N}$ whose lower density respects complements
The answer is yes: Given a set $A$ in $\mathcal{C}$ or in
$\mathcal{P}(\mathbb{N}) \setminus \mathcal{C}$, you can take
any subset $B \subset \mathbb{N} \setminus A$ of lower density $0$,
and $A \cup …
2
votes
Infinite Partitions of the Primes and Sums of Reciprocals (Revised)
A very simple way to obtain such partition of the primes is to put the $n$-th prime into
the $k$-th set in the partition, where $k$ is the number of 1's in the binary representation of $n$.