Con(u>i)

Archive for Mathematical Logic 31 (6):433-443 (1992)
  Copy   BIBTEX

Abstract

We prove here the consistency of u>i where: u=Min{|X|:X⫅P(ω) generates a non-principle ultrafilter}, i=Min{|A|:A is a maximal independent family of subsets of ω}In this we continue Goldstern and Shelah [G1Sh388] where Con(r>u) was proved using a similar but different forcing. We were motivated by Vaughan [V] (which consists of a survey and a list of open problems). For more information on the subject see [V] and [G1Sh388]

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
35 (#121,482)

6 months
6 (#1,472,471)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ideals of independence.Vera Fischer & Diana Carolina Montoya - 2019 - Archive for Mathematical Logic 58 (5-6):767-785.
The spectrum of independence.Vera Fischer & Saharon Shelah - 2019 - Archive for Mathematical Logic 58 (7-8):877-884.

View all 11 citations / Add more citations

References found in this work

Ramsey ultrafilters and the reaping number—con(r.M. Goldstern & S. Shelah - 1990 - Annals of Pure and Applied Logic 49 (2):121-142.

Add more references