The combinatorics of reasonable ultrafilters
نویسندگان
چکیده
منابع مشابه
The Combinatorics of Reasonable Ultrafilters
We are interested in generalizing part of the theory of ultrafilters on ω to larger cardinals. Here we set the scene for further investigations introducing properties of ultrafilters in strong sense dual to being normal. 0. Introduction A lot of knowledge has been accumulated on ultrafilters on ω. In the present paper we are interested in carrying out some of those arguments for ultrafilters on...
متن کاملReasonable Ultrafilters, Again
We continue investigations of reasonable ultrafilters on uncount-able cardinals defined in Shelah [8]. We introduce stronger properties of ul-trafilters and we show that those properties may be handled in λ–support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal λ with generating system of siz...
متن کاملThe Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کامل8 S ep 1 99 3 ULTRAFILTERS : WHERE TOPOLOGICAL DYNAMICS = ALGEBRA = COMBINATORICS
We survey some connections between topological dynamics, semigroups of ultrafilters, and combinatorics. As an application, we give a proof, based on ideas of Bergelson and Hindman, of the Hales-Jewett partition theorem. Furstenberg and his co-workers have shown [15, 16, 17] how to deduce combinatorial consequences from theorems about topological dynamics in compact metric spaces. Bergelson and ...
متن کاملCofinal types of ultrafilters
We study Tukey types of ultrafilters on ω, focusing on the question of when Tukey reducibility is equivalent to Rudin-Keisler reducibility. We give several conditions under which this equivalence holds. We show that there are only c many ultrafilters that are Tukey below any basically generated ultrafilter. The class of basically generated ultrafilters includes all known ultrafilters that are n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2006
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm192-1-1