Hostname: page-component-74656f9884-rngvg Total loading time: 0 Render date: 2026-11-05T23:52:40.625Z Has data issue: false hasContentIssue false

COMBINATORICS OF ULTRAFILTERS ON COHEN AND RANDOM ALGEBRAS

Published online by Cambridge University Press:  15 February 2021

JÖRG BRENDLE
Affiliation:
GRADUATE SCHOOL OF SYSTEM INFORMATICS KOBE UNIVERSITY 1-1 ROKKODAI-CHO NADA-KU KOBE, 657-8501, JAPAN E-mail: brendle@kobe-u.ac.jp E-mail: parente@people.kobe-u.ac.jp
FRANCESCO PARENTE
Affiliation:
GRADUATE SCHOOL OF SYSTEM INFORMATICS KOBE UNIVERSITY 1-1 ROKKODAI-CHO NADA-KU KOBE, 657-8501, JAPAN E-mail: brendle@kobe-u.ac.jp E-mail: parente@people.kobe-u.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect this analysis with a cardinal invariant of Boolean algebras, the ultrafilter number, and prove consistency results concerning its possible values on Cohen and random algebras.

Information

Type
Article
Copyright
© The Author(s), 2021. Published by Cambridge University Press on behalf of The Association for Symbolic Logic