Ultrafilters, monads and combinatorial properties
Logic
2017-12-19 v1
Abstract
We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as by characterizing their combinatorial properties by means of their monads. This extends to arbitrary sets methods previously used to study partition regular Diophantine equations on \N. Several applications are described by means of multiple examples.
Keywords
Cite
@article{arxiv.1712.06073,
title = {Ultrafilters, monads and combinatorial properties},
author = {Lorenzo Luperi Baglini},
journal= {arXiv preprint arXiv:1712.06073},
year = {2017}
}
Comments
31 pages