Two Consistency Results on Set Mappings

It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is consistent that there is a set mapping from the pairs of n into the finite subsets with no infinite free sets. For any n < it is consistent that there is a set mapping from the pairs of n into n with no uncountable free sets. In this paper we consider some problems on set mappings, that is, for our current purposes, functions of the type f : []k []<

• Type: Journal
• Year: 2000
• Where: JSYML
• Authors: Péter Komjáth, Saharon Shelah
• Keywords: Finite Subsets, Free Sets, JSYML 2000, Set Mapping