FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
From MaRDI portal
Publication:2921034
DOI10.1017/jsl.2013.26zbMath1337.03042arXiv1303.2572MaRDI QIDQ2921034
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
06A06: Partial orders, general
03E40: Other aspects of forcing and Boolean-valued models
03C15: Model theory of denumerable and separable structures
Related Items
Forcing with copies of countable ordinals, Forcing with copies of the Rado and Henson graphs, The poset of all copies of the random graph has the 2-localization property, Maximally embeddable components, Different similarities, Copies of the random graph, Reversibility of disconnected structures, Antichains of copies of ultrahomogeneous structures, Isomorphic and strongly connected components, Condensational equivalence, equimorphism, elementary equivalence and similar similarities
Cites Work