English
Related papers

Related papers: On idempotent ultrafilters in higher-order reverse…

200 papers

This paper uses the framework of reverse mathematics to investigate the strength of two recurrence theorems of topological dynamics. It establishes that one of these theorems, the existence of an almost periodic point, lies strictly between…

Logic · Mathematics 2013-05-28 Adam R. Day

We prove a strong dichotomy for the number of ultrapowers of a given countable model associated with nonprincipal ultrafilters on N. They are either all isomorphic, or else there are $2^{2^{\aleph_0}}$ many nonisomorphic ultrapowers. We…

Logic · Mathematics 2009-12-03 Ilijas Farah , Saharon Shelah

Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this…

Combinatorics · Mathematics 2022-03-01 David J. Fernández-Bretón

It is often claimed that analysis with infinitesimals requires more substantial use of the Axiom of Choice than traditional elementary analysis. The claim is based on the observation that the hyperreals entail the existence of nonprincipal…

Logic · Mathematics 2021-03-08 Karel Hrbacek , Mikhail G. Katz

We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors…

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

Logic · Mathematics 2010-10-01 Damir D. Dzhafarov , Carl Mummert

We give a new proof of a polynomial recurrence result due to Bergelson, Furstenberg, and McCutcheon, using idempotent ultrafilters instead of IP-limits.

Dynamical Systems · Mathematics 2007-11-06 Christian Schnell

We present a new short proof of Van der Waerden's Theorem about the existence of arbitrarily long monochromatic arithmetic progressions. The proof uses algebra in the compact space of ultrafilters $\beta\N$, but contrarily to the other…

Logic · Mathematics 2026-03-05 Mauro Di Nasso

Ultrafilters are useful mathematical objects having applications in nonstandard analysis, Ramsey theory, Boolean algebra, topology, and other areas of mathematics. In this note, we provide a categorical construction of ultrafilters in terms…

Category Theory · Mathematics 2009-05-13 Daniel Litt , Zachary Abel , Scott D. Kominers

In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…

Logic · Mathematics 2023-11-15 Jeffry L. Hirst , Carl Mummert

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Logic · Mathematics 2023-10-11 Paul Shafer

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…

Logic · Mathematics 2014-06-13 Lorenzo Luperi Baglini

We introduce the notion of a coherent $P$-ultrafilter on a complete ccc Boolean algebra, strenghtening the notion of a $P$-point on $\omega$, and show that these ultrafilters exist generically under ${\mathfrak c} = {\mathfrak d}$. This…

General Topology · Mathematics 2015-06-04 Jan Starý

We continue the research of the relation $\hspace{1mm}\widetilde{\mid}\hspace{1mm}$ on the set $\beta {\mathbb{N}}$ of ultrafilters on ${\mathbb{N}}$, defined as an extension of the divisibility relation. It is a quasiorder, so we see it as…

Logic · Mathematics 2023-06-22 Boris Šobot

Van der Waerden's theorem asserts that if you color the natural numbers with, say, five different colors, then you can always find arbitrarily long sequences of numbers that have the same color and that form an arithmetic progression.…

Functional Analysis · Mathematics 2012-06-06 Heinrich-Gregor Zirnstein

Sets satisfying Central sets theorem and other Ramsey theoretic large sets were studied extensively in literature. Hindman and Strauss proved that product of some of these large sets is again large. In this paper we show that if we take two…

Combinatorics · Mathematics 2024-10-31 Sujan Pal , Jyotirmoy Poddar

This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such…

Logic · Mathematics 2011-04-25 Victoria Gitman , Philip Welch

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…

Combinatorics · Mathematics 2011-08-23 Nadav Samet , Boaz Tsaban

We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…

Logic · Mathematics 2024-01-30 David J. Fernández-Bretón