Abstract
In this article, we study set mappings on 4-tuples. We continue a previous work of Komjath and Shelah by getting new finite bounds on the size of free sets in a generic extension. This is obtained by an entirely different forcing construction. Moreover, we prove a ZFC result for set mappings on 4-tuples. Also, as another application of our forcing construction, we give a consistency result for set mappings on triples.
| Original language | English |
|---|---|
| Pages (from-to) | 405-416 |
| Number of pages | 12 |
| Journal | Notre Dame Journal of Formal Logic |
| Volume | 59 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2018 |
Bibliographical note
Publisher Copyright:© 2018 by University of Notre Dame.
Keywords
- Combinatorial set theory
- Set mappings
Fingerprint
Dive into the research topics of 'Set mappings on 4-tuples'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver