Connected Reduced Products
Logic
2022-08-02 v1
Abstract
If is a binary relation on a set , the structure is connected iff the minimal equivalence relation containing is the full relation on . We show that, for a set the following conditions are equivalent (a) is less than the first measurable cardinal, (b) For each filter and each family of binary structures, the reduced product is connected, iff there are a finite set and such that is connected, for each , and , (c)The ultraproduct is a disconnected graph for each non-principal ultrafilter , where is the linear graph on . Moreover, the implication "" in (b) holds in ZFC.
Keywords
Cite
@article{arxiv.2208.00038,
title = {Connected Reduced Products},
author = {Miloš S. Kurilić},
journal= {arXiv preprint arXiv:2208.00038},
year = {2022}
}