Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"strongly reductible"”.
-
Ramsey Algebras and Ramsey Spaces
Hindman's theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Galvin and Glazer gave a brilliant simple proof of Hindman's theorem using idempotent ultrafilters. We study Ramsey algebras, which are structures that satisfy an analogue of Hindman's …