Different similarities

DOI10.1007/S00153-015-0443-XzbMATH Open1373.03049arXiv1412.2073OpenAlexW2914229770MaRDI QIDQ892137FDOQ892137

Miloš S. Kurilić

Publication date: 18 November 2015

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Abstract: We establish the hierarchy among twelve equivalence relations (similarities) on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relation, four similarities of structures induced by similarities of their self-embedding monoids and intersections of these equivalence relations. In particular, fixing a language $L$ and a cardinal $kappa$, we consider the interplay between the restrictions of these similarities to the class $Mo{d}_L(kappa)$ of all $L$-structures of size $kappa$. It turns out that, concerning the number of different similarities and the shape of the corresponding Hasse diagram, the class of all structures naturally splits into three parts: finite structures, infinite structures of unary languages, and infinite structures of non-unary languages (where all these similarities are different).

Full work available at URL: https://arxiv.org/abs/1412.2073

zbMATH Keywords

partial orderisomorphismisomorphic substructurerelational structureequimorphismforcing equivalenceself-embedding monoid

Mathematics Subject Classification ID

Partial orders, general (06A06) Semigroups of transformations, relations, partitions, etc. (20M20) Basic properties of first-order languages and structures (03C07) Other aspects of forcing and Boolean-valued models (03E40)

Cites Work

• Set theory. An introduction to independence proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Isomorphic and strongly connected components
• The poset of all copies of the random graph has the 2-localization property
• From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
• Maximally embeddable components
• Posets of copies of countable scattered linear orders
• Forcing by non-scattered sets
• Title not available (Why is that?)
• Forcing with copies of countable ordinals
• Title not available (Why is that?)
• The distributivity numbers of $\mathcal {P}(\omega )$/fin and its square
• Title not available (Why is that?)
• Copies of the random graph
• Title not available (Why is that?)

Cited In (9)

• Condensational equivalence, equimorphism, elementary equivalence and similar similarities
• Posets of copies of countable ultrahomogeneous tournaments
• The poset of all copies of the random graph has the 2-localization property
• Title not available (Why is that?)
• Forcing with copies of the Rado and Henson graphs
• Copies of the random graph
• Posets of copies of countable non-scattered labeled linear orders
• Almost similar configurations
• Similar but not the same: various versions of ♣ do not coincide

This page was built for publication: Different similarities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892137)