Posets of copies of countable ultrahomogeneous tournaments

DOI10.1016/j.apal.2024.103486MaRDI QIDQ6584958

Stevo Todorčević, Miloš S. Kurilić

Publication date: 8 August 2024

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

dense local orderrandom tournamentposet of copies\( \sigma \)-closed forcingsacks forcingultrahomogeneous tournament

Mathematics Subject Classification ID

Partial orders, general (06A06) Models with special properties (saturated, rigid, etc.) (03C50) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The poset of all copies of the random graph has the 2-localization property
• Forcing by non-scattered sets
• Different similarities
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Copies of the random graph
• Posets of copies of countable non-scattered labeled linear orders
• Isomorphic and strongly connected components
• A survey of homogeneous structures
• Condensational equivalence, equimorphism, elementary equivalence and similar similarities
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Countable Homogeneous Tournaments
• Universal graphs and universal functions
• Asymmetric graphs
• Forcing with copies of the Rado and Henson graphs

This page was built for publication: Posets of copies of countable ultrahomogeneous tournaments

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