arXiv:1510.02216 Abstract | arXiv Analytics

arXiv:1510.02216 [math.LO]Abstract References Reviews Resources

Independence for $(λ,μ)$

Published 2015-10-08Version 1

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.

Comments: Submitted

Categories: math.LO

Keywords: independence, study set mappings, forcing construction, finite bounds, generic extension

Related articles: Most relevant | Search more

arXiv:1906.04273 [math.LO] (Published 2019-06-10)

Independence in Arithmetic: The Method of $(\mathcal L, n)$-Models

Corey Bacal Switzer

arXiv:math/9201239 [math.LO] (Published 1989-04-15)

A note on canonical functions

Thomas Jech, Saharon Shelah

arXiv:1405.7456 [math.LO] (Published 2014-05-29, updated 2014-12-10)

Computable structures in generic extensions