Isomorphic and Strongly Connected Components
Logic
2017-09-26 v1
Abstract
We study the partial orderings of the form , where is a binary relational structure with the connectivity components isomorphic to a strongly connected structure and is the set of (domains of) substructures of isomorphic to . We show that, for example, for a countable , the poset is either isomorphic to a finite power of or forcing equivalent to a separative atomless -closed poset and, consistently, to Fin. In particular, this holds for each ultrahomogeneous structure such that or is a disconnected structure and in this case can be replaced by an ultrahomogeneous connected digraph.
Cite
@article{arxiv.1311.5049,
title = {Isomorphic and Strongly Connected Components},
author = {Milos Kurilic},
journal= {arXiv preprint arXiv:1311.5049},
year = {2017}
}
Comments
16 pages, 1 figure