Reducts of random hypergraphs

DOI10.1016/0168-0072(95)00061-5zbMath0865.03025OpenAlexW2157624263MaRDI QIDQ1923569

Simon Thomas

Publication date: 1 July 1997

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

Full work available at URL: http://hdl.handle.net/11693/49063

zbMATH Keywords

permutation groupsautomorphism groupsrandom hypergraphsreductclassification of reductscountable \(\omega\)-categorical structureequivalent reductsuniversal homogeneous \(k\)-hypergraphs

Mathematics Subject Classification ID

Representations of general topological groups and semigroups (22A25) Hypergraphs (05C65) Model-theoretic algebra (03C60) Models of other mathematical theories (03C65) Categoricity and completeness of theories (03C35)

Related Items (20)

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 42 reducts of the random ordered graph ⋮ Reducts of the random bipartite graph ⋮ COHERENT EXTENSION OF PARTIAL AUTOMORPHISMS, FREE AMALGAMATION AND AUTOMORPHISM GROUPS ⋮ The lattice of definability: origins, recent developments, and further directions ⋮ Reducts of the generic digraph ⋮ REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS ⋮ Reducts of the random partial order ⋮ Permutations on the random permutation ⋮ Reducts of the Henson graphs with a constant ⋮ Overgroups of the Automorphism Group of the Rado Graph ⋮ Minimal functions on the random graph ⋮ A survey of homogeneous structures ⋮ The affine and projective groups are maximal ⋮ Schaefer's Theorem for Graphs ⋮ Permutation groups with small orbit growth ⋮ The 116 reducts of (ℚ, <, a) ⋮ Permutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element field

Cites Work

• \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures
• A classification of the maximal subgroups of the finite alternating and symmetric groups
• Partitions of finite relational and set systems
• ℵ₀ -Categorical Structures Smoothly Approximated by Finite Substructures
• Reducts of the random graph
• Models Without Indiscernibles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducts of random hypergraphs