Isomorphic and Strongly Connected Components

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…