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

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

A variety of classes of naturally arising ultrafilters on omega is discussed, and the question is raised whether it is consistent that the classes are empty. Since all the classes contain the P-point ultrafilters, a negative answer would…

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Hartman-Grobman theorem was initially extended to the non-autonomous cases by Palmer. Usually, dichotomy is an essential condition of Palmer's linearization theorem. Is Palmer's linearization theorem valid for the systems with trichotomy?…

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

The results of this thesis allows one to replace calculations in tricategories with equivalent calculations in Gray categories (aka semistrict tricategories). In particular the rewriting calculus for Gray categories as used for example by…

What should a function that extrapolates beyond known input/output examples look like? This is a tricky question to answer in general, as any function matching the outputs on those examples can in principle be a correct extrapolant. We…

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

A triangle decomposition of a graph $G$ is a partition of the edges of $G$ into triangles. Two necessary conditions for $G$ to admit such a decomposition are that $|E(G)|$ is a multiple of three and that the degree of any vertex in $G$ is…

The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…

There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as…

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Let $X$ be a complete measure space of finite measure. The Lebesgue transform of an integrable function $f$ on $X$ encodes the collection of all the mean-values of $f$ on all measurable subsets of $X$ of positive measure. In the problem of…

We show that it is equiconsistent with $\mathsf{ZF}$ that Fodor's lemma fails everywhere, and furthermore that the club filter on every regular cardinal is not even $\sigma$-complete. Moreover, these failures can be controlled in a very…

Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf{GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from…

We continue the study of the pseudo-intersection property with respect to an ideal introduced in \cite{TomNatasha2}. Our theory applies to the study of the Tukey types of general sums of ultrafilters, which, as evidenced by the results of…

Superfilters are generalized ultrafilters, which capture the underlying concept in Ramsey theoretic theorems such as van der Waerden's Theorem. We establish several properties of superfilters, which generalize both Ramsey's Theorem and its…

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

We prove that if an ultrafilter L is not coherent to a Q-point, then each analytic non-sigma-bounded topological group G admits an increasing chain <G_a : a < b(L)> of its proper subgroups such that: (i) U_{a in b(L)} G_a=G; and $(ii)$ For…