English

Isomorphic and Strongly Connected Components

Logic 2017-09-26 v1

Abstract

We study the partial orderings of the form P(X),\langle {\mathbb P} ({\mathbb X}), \subset \rangle , where X{\mathbb X} is a binary relational structure with the connectivity components isomorphic to a strongly connected structure Y{\mathbb Y} and P(X){\mathbb P} ({\mathbb X}) is the set of (domains of) substructures of X{\mathbb X} isomorphic to X{\mathbb X}. We show that, for example, for a countable X{\mathbb X}, the poset P(X),\langle {\mathbb P} ({\mathbb X}), \subset \rangle is either isomorphic to a finite power of P(Y){\mathbb P} ({\mathbb Y}) or forcing equivalent to a separative atomless σ\sigma-closed poset and, consistently, to P(ω)/P(\omega )/Fin. In particular, this holds for each ultrahomogeneous structure X{\mathbb X} such that X{\mathbb X} or Xc{\mathbb X} ^c is a disconnected structure and in this case Y{\mathbb Y} can be replaced by an ultrahomogeneous connected digraph.

Keywords

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

R2 v1 2026-06-22T02:11:12.990Z