相关论文: The combinatorics of reasonable ultrafilters
In standard construction of hyperrational numbers using an ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with…
We further investigate a divisibility relation on the set $\beta N$ of ultrafilters on the set of natural numbers. We single out prime ultrafilters (divisible only by 1 and themselves) and establish a hierarchy in which a position of every…
The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.
We introduce various colouring principles which generalise the so-called "onto mapping principle" of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow to…
We isolate a new class of ultrafilters on N, called "quasi-selective" because they are intermediate between selective ultrafilters and P-points. (Under the Continuum Hypothesis these three classes are distinct.) The existence of…
We introduce the notion of a positive opetope and positive opetopic cardinals as certain finite combinatorial structures. The positive opetopic cardinals to positive-to-one polygraphs are like simple graphs to free omega-categories over…
We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…
In \cite{HK}, Hayut and Karagila asked some questions about uniform ultrafilters in a choiceless context. We provide several answers to their questions.
Under MA we prove that for the ideal $\cal I$ of thin sets on $\omega$ and for any ordinal $\gamma \leq \omega_1$ there is an ${\cal I}$-ultrafilter (in the sense of Baumgartner), which belongs to the class ${\cal P}_{\gamma}$ of…
We extend a theorem by Juh\'asz and Szentmikl\'ossy to notions related to pseudocompactness. We also allow the case when one of the cardinals under consideration is singular. We give an application to the study of decomposable ultrafilters:…
An extension of the divisibility relation on $\mathbb{N}$ to the set $\beta\mathbb{N}$ of ultrafilters on $\mathbb{N}$ was defined and investigated in several papers during the last ten years. Here we make a survey of results obtained so…
We extend theories of reverse mathematics by a non-principal ultrafilter, and show that these are conservative extensions of the usual theories ACA0, ATR0, and Pi11-Comprehension.
An assortments of `species' of families of subsets of a set and some of their properties are investigated, with an eye on the logic and limit role they may play as `relaxed parallels' to ultrafilters.
Following Baumgartner [J. Symb. Log. 60 (1995), no. 2], for an ideal $\mathcal{I}$ on $\omega$, we say that an ultrafilter $\mathcal{U}$ on $\omega$ is an $\mathcal{I}$-ultrafilter if for every function $f:\omega\to\omega$ there is $A\in…
Let $\mathcal{E}$ be the $\sigma$-ideal generated by the closed measure zero sets of reals. We use an ultrafilter-extendable matrix iteration of ccc posets to force that, for $\mathcal{E}$, their associated cardinal characteristics (i.e.\…
This is a survey of the use of Fourier analysis in additive combinatorics, with a particular focus on situations where it cannot be straightforwardly applied, but needs to be generalized first. Sometimes very satisfactory generalizations…
While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…
If cf(kappa) = kappa, kappa^+< cf(lambda) = \lambda, then there is a stationary subset S of {delta<lambda:cf(delta)=kappa} in I[lambda]. Moreover, we can find <C_delta :delta in S>, C_delta a club of lambda, otp(C_delta)=kappa, guessing…
We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action…