The 42 reducts of the random ordered graph

DOI10.1112/plms/pdv037zbMath1382.03057arXiv1309.2165OpenAlexW3103323169MaRDI QIDQ2949677

András Pongrácz, Manuel Bodirsky, Michael Pinsker

Publication date: 2 October 2015

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Interpolation, preservation, definability (03C40) Model theory of denumerable and separable structures (03C15) Infinite automorphism groups (20B27)

Related Items

Lattice of definability (of reducts) for integers with successor ⋮ Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ Infinitely many reducts of homogeneous structures ⋮ PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS ⋮ The lattice of definability: origins, recent developments, and further directions ⋮ Reducts of the generic digraph ⋮ THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION ⋮ Permutations on the random permutation ⋮ Unnamed Item ⋮ Ramsey degrees: big v. small ⋮ Permutation groups with small orbit growth ⋮ Functional reducts of the countable atomless Boolean algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Reducts of the random partial order
• Permutations on the random permutation
• The partite construction and Ramsey set systems
• Transitivity of permutation groups on unordered sets
• Reducts of random hypergraphs
• Minimal functions on the random graph
• A survey of homogeneous structures
• The 116 reducts of (ℚ, <, a)
• Reducts of the random graph
• Models Without Indiscernibles
• Decidability of Definability