On random relational structures

@article{Droste2003OnRR,
  title={On random relational structures},
  author={Manfred Droste and Dietrich Kuske},
  journal={J. Comb. Theory, Ser. A},
  year={2003},
  volume={102},
  pages={241-254}
}
Erd + os and Rényi gave a probabilistic construction of the countable universal homogeneous graph. We extend their result to more general structures of first-order predicate calculus. Our main result shows that if a class of countable relational structures C contains an infinite ocategorical universal homogeneous structure U; then U can be constructed probabilistically. r 2003 Elsevier Science (USA). All rights reserved. 

From This Paper

Topics from this paper.
6 Citations
13 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

D

  • R. Kaye
  • Macpherson (Eds.), Automorphisms of First-Order…
  • 1994

Model Theory

  • W. Hodges
  • Cambridge University Press, Cambridge
  • 1993

Rényi , Asymmetric graphs , Acta Math

  • A.
  • Acad . Sci . Hungar .
  • 1993

The random graph and automorphisms of the rational world

  • A. Mekler, R. Schipperus, S. Shelah, J. K. Truss
  • Bull. London Math. Soc
  • 1993

A categorical theorem on universal objects and its application in abelian group theory and computer science

  • M. Droste, R. Göbel
  • Contemporary Mathematics, International…
  • 1989

Göbel , Universal domains and the amalgamation property , Math

  • R. M. Droste
  • Struct . Computer Sci .
  • 1989

The group of almost automorphisms of the countable universal graph, Math

  • J. K. Truss
  • Proc. Cambridge Philos. Soc
  • 1989

The group of the countable universal graph, Math

  • J. K. Truss
  • Proc. Cambridge Philos. Soc
  • 1985

Similar Papers

Loading similar papers…