## Abstract

A structure M has no algebraicity if, for every finite A |M| and a |M| A is not algebraic over A. Let K be the class of _{0}-categorical structures without algebraicity, and M K. The structure M is group-categorical in K if for every N K the following holds: if Aut(N) Aut(M), then the permutation groups Aut(N), and Aut(M), are isomorphic. prove a theorem stating that if has a interpretation(see Definition 2.1), then it is group-categorical in K. By applying the above theorem we prove that the random graph, the universal poset, the universal tournament, <, the family with 2 many directed graphs constructed by Henson in [10], all trees belonging to K, and various other structures, are group-categorical in K. It is easy to determine the outer automorphism group of the automorphism group of a group-categorical structure. For example, if is the automorphism group of the universal countable n-coloured graph, then Out S_{n}. Here S_{n} denotes the symmetric group on n elements.

Original language | English |
---|---|

Pages (from-to) | 225-249 |

Number of pages | 25 |

Journal | Proceedings of the London Mathematical Society |

Volume | s3-69 |

Issue number | 2 |

DOIs | |

State | Published - 1 Jan 1994 |

## ASJC Scopus subject areas

- Mathematics (all)

## Fingerprint

Dive into the research topics of 'On the reconstruction of x_{0}-categorical structures from their automorphism groups'. Together they form a unique fingerprint.