相关论文: The Filter Dichotomy Principle Does not Imply the …

We introduce a density counterpart of the Scheepers covering property $\bigcup_{\mathrm{fin}}(\mathcal O,\Omega)$ and study its relations to known combinatorial density property. In particular, we show that it is equivalent to the…

We study some topics about \L o\'s's theorem without assuming the Axiom of Choice. We prove that \L o\'s's fundamental theorem of ultraproducts is equivalent to a weak form that every ultrapower is elementary equivalent to its source…

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

We study ultrafilters from the perspective of the algebra in the \v{C}ech-Stone compactification of the natural numbers, and idempotent elements therein. The first two results that we prove establish that, if $p$ is a Q-point (resp. a…

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

The classic Fatou lemma states that the lower limit of a sequence of integrals of functions is greater or equal than the integral of the lower limit. It is known that Fatou's lemma for a sequence of weakly converging measures states a…

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

We show from a weak comparison principle (the Ultrapower Axiom) that the Mitchell order is linear on certain kinds of ultrafilters: normal ultrafilters, Dodd solid ultrafilters, and assuming GCH, generalized normal ultrafilters. In the…

We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

The problems of continuation of a partially defined metric and a partially defined ultrametric were considered in (O. Dovgoshey, O. Martio and M. Vuorinen, Metrization of weighted graphs, Ann. Comb., 17:455--476, 2013) and (A. A. Dovgoshey…

All ultrafilters under consideration here are non-principal ultrafilters on the set omega of natural numbers. We are concerned with the possible cofinalities of ultrapowers of omega with respect to such ultrafilters. We show that no…

Motivated by a question of Isbell, we show that Jensen's Diamond Principle implies there is a non-P-point ultrafilter U on omega such that U, whether ordered by reverse inclusion or reverse inclusion mod finite, is not Tukey equivalent to…

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

Given a scheme X over a complete discrete valuation ring ${\mathcal O}_K$ of mixed characteristic,Gros,in his study of syntomic cohomology in the smooth and proper case, introduced a filtration on the rigid cohomology of the special fiber…

We show that while the length $\omega$ iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Prikry forcing, it is consistent that no iteration of length greater than $\omega$ (of the same ultrafilter…

In \cite{reed97}, Reed conjectures that the inequality $\chi (G) \leq \left \lceil \textstyle {1/2} (\omega (G) + \Delta (G) + 1) \right \rceil$ holds for any graph $G$. We prove this holds for a graph $G$ if $\bar{G}$ is disconnected. From…

Let $\mathcal{X}$ be a semibrick in an extriangulated category $\mathscr{C}$. Let $\mathcal{T}$ be the filtration subcategory generated by $\mathcal{X}$. We give a one-to-one correspondence between simple semibricks and length wide…

A combinatorial proof of a pigeonhole principle of Gowers is found along with its symmetric and approximate version, FIN$_k^\pm$ theorem. The proofs do not use of the concept of ultrafilter.

After [J.Herzog, D.Popescu, Finite filtrations of modules and shellable multicomplexes, Preprint IMAR no 4/2005, Bucharest, 2005], the shellability of multicomplexes $\Gamma$ is given in terms of some special faces of $\Gamma$ called…