Reversibility of extreme relational structures

DOI10.1007/S00153-019-00703-9MaRDI QIDQ781506zbMATH OpenOpenAlexWikidataFDO

Authors Miloš S. Kurilić, Nenad Morača

Publication date 17 July 2020

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

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

zbMATH Keywords

forbidden structureinfinitary languagemaximal (minimal) structurerelational structurereversible structureultrahomogeneous graphs

Mathematics Subject Classification ID

Other model constructions (03C30) Models with special properties (saturated, rigid, etc.) (03C50) Properties of classes of models (03C52) Applications of model theory (03C98) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Abstract: A relational structure $mathbbX$ is called reversible iff each bijective homomorphism from $mathbbX$ onto $mathbbX$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible structures of a given relational language $L$ is to notice that the maximal or minimal elements of isomorphism-invariant sets of interpretations of the language $L$ on a fixed domain $X$ determine reversible structures. We isolate certain syntactical conditions providing that a consistent $L_{inftyomega}$-theory defines a class of interpretations having extreme elements on a fixed domain and detect several classes of reversible structures. In particular, we characterize the reversible countable ultrahomogeneous graphs.

Recommendations

• Retractions of reversible structures
• Nonreversible trees having a removable edge
• Reversible disjoint unions of well orders and their inverses
• Reversible and bijectively related posets
• Homomorphism-Homogeneous Relational Structures

Cites work

• A family of countable homogeneous graphs
• Asymmetric graphs
• Condensational equivalence, equimorphism, elementary equivalence and similar similarities
• Countable Ultrahomogeneous Undirected Graphs
• scientific article; zbMATH DE number 3301418 (Why is no real title available?)
• scientific article; zbMATH DE number 3093420 (Why is no real title available?)
• Infinite combinatorics: from finite to infinite
• Retractions of reversible structures
• Reversible and bijectively related posets
• Reversible disjoint unions of well orders and their inverses
• Reversible topological spaces
• The random graph
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.

Cited in

(7)

• Reversibility of disconnected structures
• Reversible disjoint unions of well orders and their inverses
• Reversible and bijectively related posets
• Contextual equivalences in configuration structures and reversibility
• Retractions of reversible structures
• On the number of reversible homogeneous structures
• Nonreversible trees having a removable edge

This page was built for publication: Reversibility of extreme relational structures

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