Reducts of random hypergraphs

Annals of Pure and Applied Logic 80 (2):165-193 (1996)
  Copy   BIBTEX

Abstract

For each k 1, let Γk be the countable universal homogeneous k-hypergraph. In this paper, we shall classify the closed permutation groups G such that Aut G Sym. In particular, we shall show that there exist only finitely many such groups G for each k 1. We shall also show that each of the associated reducts of Γk is homogeneous with respect to a finite relational language

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(95)00061-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the undecidability of some classes of abelian-by-finite groups.Annalisa Marcja, Mike Prest & Carlo Toffalori - 1993 - Annals of Pure and Applied Logic 62 (2):167-173.
On -Homogeneous, but Not -Transitive Permutation Groups.Saharon Shelah & Lajos Soukup - 2023 - Journal of Symbolic Logic 88 (1):363-380.
Classification of -Categorical Monadically Stable Structures.Bertalan Bodor - 2024 - Journal of Symbolic Logic 89 (2):460-495.
On countable homogeneous 3-hypergraphs.Reza Akhtar & Alistair H. Lachlan - 1995 - Archive for Mathematical Logic 34 (5):331-344.
The primal framework II: smoothness.J. T. Baldwin & S. Shelah - 1991 - Annals of Pure and Applied Logic 55 (1):1-34.
Definability in the h -quasiorder of labeled forests.Oleg V. Kudinov, Victor L. Selivanov & Anton V. Zhukov - 2009 - Annals of Pure and Applied Logic 159 (3):318-332.
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
Definability and decidability in infinite algebraic extensions.Alexandra Shlapentokh & Carlos Videla - 2014 - Annals of Pure and Applied Logic 165 (7-8):1243-1262.
Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
Definably compact Abelian groups.Mário J. Edmundo & Margarita Otero - 2004 - Journal of Mathematical Logic 4 (02):163-180.

Analytics

Added to PP
2014-01-16

Downloads
37 (#419,852)

6 months
14 (#253,780)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

First-order logical duality.Steve Awodey - 2013 - Annals of Pure and Applied Logic 164 (3):319-348.
The 116 reducts of (ℚ, <,a).Markus Junker & Martin Ziegler - 2008 - Journal of Symbolic Logic 73 (3):861-884.
Reducts of the generic digraph.Lovkush Agarwal - 2016 - Annals of Pure and Applied Logic 167 (3):370-391.
Disjoint $n$ -Amalgamation and Pseudofinite Countably Categorical Theories.Alex Kruckman - 2019 - Notre Dame Journal of Formal Logic 60 (1):139-160.

View all 10 citations / Add more citations

References found in this work

Model theory.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.
ℵ0-Categorical, ℵ0-stable structures.G. Cherlin, L. Harrington & A. H. Lachlan - 1985 - Annals of Pure and Applied Logic 28 (2):103-135.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Reducts of the random graph.Simon Thomas - 1991 - Journal of Symbolic Logic 56 (1):176-181.

Add more references