Abstract
We introduce a generalization of stationary set reflection which we call filter reflection, and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection from ZFC, and present applications of filter reflection to the study of canonical equivalence relations over the higher Cantor and Baire spaces.
| Original language | English |
|---|---|
| Pages (from-to) | 295-345 |
| Number of pages | 51 |
| Journal | Israel Journal of Mathematics |
| Volume | 245 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Oct 2021 |
Austrian Fields of Science 2012
- 101013 Mathematical logic
Keywords
- REDUCIBILITY
- STATIONARY
- TREES
Fingerprint
Dive into the research topics of 'Fake reflection'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver