Finite Embeddability of Sets and Ultrafilters

• Autorzy: Andreas Blass , Mauro Di Nasso
• Języki publikacji: EN

Abstrakty

EN

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper we study it in its own right. We also study a related notion of finite embeddability of ultrafilters on the natural numbers. Among other results, we obtain connections between finite embeddability and the algebraic and topological structure of the Stone-Čech compactification of the discrete space of natural numbers. We also obtain connections with nonstandard models of arithmetic.

Kategorie tematyczne

• 03H15: Nonstandard models of arithmetic
• 03E05: Other combinatorial set theory

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Bulletin of the Polish Academy of Sciences. Mathematics
• Rocznik: 2015
• Tom: 63
• Numer: 3
• Strony: 195-206

Daty

wydano

2015

Twórcy

autor

Andreas Blass

• Mathematics Department, University of Michigan, Ann Arbor, MI 48109, U.S.A.

autor

Mauro Di Nasso

• Dipartimento di Matematica, Università di Pisa, 56127 Pisa, Italy

Identyfikatory

DOI

10.4064/ba8024-1-2016