Set mappings on 4-tuples
From MaRDI portal
Abstract: In this paper 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 and also as another application of our forcing construction we give a consistency result for set mappings on triples.
Recommendations
Cites work
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 3506705 (Why is no real title available?)
- scientific article; zbMATH DE number 878343 (Why is no real title available?)
- An infinite combinatorial statement with a poset parameter
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Combinatorial set theory: Partition relations for cardinals
- Proof of a conjecture of B. Ruziewicz
- Two consistency results on set mappings
Cited in
(5)- scientific article; zbMATH DE number 4061312 (Why is no real title available?)
- scientific article; zbMATH DE number 1062566 (Why is no real title available?)
- Some simple theories from a Boolean algebra point of view
- Keisler's order has infinitely many classes
- scientific article; zbMATH DE number 4010623 (Why is no real title available?)
This page was built for publication: Set mappings on 4-tuples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782243)