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: 91,164

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

Reducts of the random graph.Simon Thomas - 1991 - Journal of Symbolic Logic 56 (1):176-181.
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.
Recombination induced hypergraphs: A new approach to mutation-recombination isomorphism.Paul Gitchoff & G.�Nter P. Wagner - 1996 - Complexity 2 (1):37-43.
Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.
Quantum logic properties of hypergraphs.Matthias P. Kläy - 1987 - Foundations of Physics 17 (10):1019-1036.
On countable homogeneous 3-hypergraphs.Reza Akhtar & Alistair H. Lachlan - 1995 - Archive for Mathematical Logic 34 (5):331-344.
Observables on hypergraphs.S. P. Gudder & G. T. Rüttimann - 1986 - Foundations of Physics 16 (8):773-790.
The reducts of equality up to primitive positive interdefinability.Manuel Bodirsky, Hubie Chen & Michael Pinsker - 2010 - Journal of Symbolic Logic 75 (4):1249-1292.
Reducts of some structures over the reals.Ya′Acov Peterzil - 1993 - Journal of Symbolic Logic 58 (3):955-966.
Reducts of (c, +, ⋅) which contain +.D. Marker & A. Pillay - 1990 - Journal of Symbolic Logic 55 (3):1243-1251.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
On neat reducts of algebras of logic.Tarek Sayed Ahmed & Istvan Németi - 2001 - Studia Logica 68 (2):229-262.
On the construction of effectively random sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.
Uniform distribution and algorithmic randomness.Jeremy Avigad - 2013 - Journal of Symbolic Logic 78 (1):334-344.

Analytics

Added to PP
2014-01-16

Downloads
28 (#533,797)

6 months
5 (#510,007)

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.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.

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