Different similarities
From MaRDI portal
Publication:892137
DOI10.1007/s00153-015-0443-xzbMath1373.03049arXiv1412.2073OpenAlexW2914229770MaRDI QIDQ892137
Publication date: 18 November 2015
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.2073
isomorphismpartial orderrelational structureisomorphic substructureequimorphismforcing equivalenceself-embedding monoid
Partial orders, general (06A06) Semigroups of transformations, relations, partitions, etc. (20M20) Other aspects of forcing and Boolean-valued models (03E40) Basic properties of first-order languages and structures (03C07)
Related Items (5)
The poset of all copies of the random graph has the 2-localization property ⋮ Condensational equivalence, equimorphism, elementary equivalence and similar similarities ⋮ Posets of copies of countable non-scattered labeled linear orders ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Copies of the random graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The poset of all copies of the random graph has the 2-localization property
- Maximally embeddable components
- Posets of copies of countable scattered linear orders
- Forcing by non-scattered sets
- Set theory. An introduction to independence proofs
- Copies of the random graph
- Isomorphic and strongly connected components
- FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
- The distributivity numbers of $\mathcal {P}(\omega )$/fin and its square
- Forcing with copies of countable ordinals
This page was built for publication: Different similarities
