Back and Forth Systems Witnessing Irreversibility

Abstract

If L is a relational language, then an L-structure X= X, is reversible iff there is no interpretation σ such that the structures X, σ and X, are isomorphic. We show that X is not reversible iff there is a back and forth system of partial self-condensations of X containing one which is not a partial isomorphism and having certain closure properties. Using that characterization we detect several classes of non-reversible partial orders containing, for example, homogeneous-universal posets (in particular, the random poset), the divisibility lattice, N ,\,\,, the ideals [ ]<λ, the meager ideal in the algebra Borel(ω ω), and the direct powers of rationals, Q , and integers, Z . Some of the results are obtained under additional set-theoretic assumptions.

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…