Finite Embeddability of Sets and Ultrafilters

Andreas Blass; Mauro Di Nasso

Bulletin of the Polish Academy of Sciences. Mathematics (2015)

  • Volume: 63, Issue: 3, page 195-206
  • ISSN: 0239-7269

Abstract

top
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.

How to cite

top

Andreas Blass, and Mauro Di Nasso. "Finite Embeddability of Sets and Ultrafilters." Bulletin of the Polish Academy of Sciences. Mathematics 63.3 (2015): 195-206. <http://eudml.org/doc/281202>.

@article{AndreasBlass2015,
abstract = {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.},
author = {Andreas Blass, Mauro Di Nasso},
journal = {Bulletin of the Polish Academy of Sciences. Mathematics},
keywords = {ultrafilter; nonstandard models; shift map},
language = {eng},
number = {3},
pages = {195-206},
title = {Finite Embeddability of Sets and Ultrafilters},
url = {http://eudml.org/doc/281202},
volume = {63},
year = {2015},
}

TY - JOUR
AU - Andreas Blass
AU - Mauro Di Nasso
TI - Finite Embeddability of Sets and Ultrafilters
JO - Bulletin of the Polish Academy of Sciences. Mathematics
PY - 2015
VL - 63
IS - 3
SP - 195
EP - 206
AB - 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.
LA - eng
KW - ultrafilter; nonstandard models; shift map
UR - http://eudml.org/doc/281202
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.