FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES

DOI10.1017/JSL.2013.26zbMath1337.03042arXiv1303.2572OpenAlexW2071239363MaRDI QIDQ2921034

Miloš S. Kurilić

Publication date: 30 September 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

posetforcingrelational structureisomorphic substructure

Mathematics Subject Classification ID

Partial orders, general (06A06) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)

Related Items (10)

The poset of all copies of the random graph has the 2-localization property ⋮ Antichains of copies of ultrahomogeneous structures ⋮ Condensational equivalence, equimorphism, elementary equivalence and similar similarities ⋮ Maximally embeddable components ⋮ Different similarities ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Isomorphic and strongly connected components ⋮ Forcing with copies of countable ordinals ⋮ Copies of the random graph ⋮ Reversibility of disconnected structures

Cites Work

• Unnamed Item
• Set theory. An introduction to independence proofs
• Compacts de fonctions mesurables et filtres non mesurables

This page was built for publication: FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES