Back to search

University of Leeds

Reducts of aleph_zero-categorical structures

Abstract

dc:description.abstract

Given two structures M and N on the same domain, we say that N is a reduct of M if all emptyset-definable relations of N are emptyset-definable in M. In this thesis, the reducts of the generic digraph, the Henson digraphs, the countable vector space over F_2 and of the linear order Q.2 are classified up to first-order interdefinability. These structures are aleph_zero-categorical, so classifying their reducts is equivalent to classifying the closed groups that lie in between the structures’ automorphism groups and the full symmetric group.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of Leeds
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Agarwal, Lovkush
Advisor dc:contributor.advisor
  • Truss, John

Rights

Language dc:language.dcterms_iso639_2
eng

Identifiers

dc:identifier.*
Identifier
uk.bl.ethos.698265

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Agarwal, Lovkush. Reducts of aleph_zero-categorical structures. doctoral thesis, University of Leeds, 2016.