An ultrafilter on is kappa-complete if, for every index set with and every family of members of ,The bound is strictly fewer than sets. In particular every ultrafilter is -complete, since this requires only finite intersections; countably complete ultrafilters require intersections of countably many members, equivalently -completeness.
Articles by others on the same topic
There are currently no matching articles.