Computability and categoricity of weakly ultrahomogeneous structures

From MaRDI portal
Publication:4601031

DOI10.3233/COM-170070zbMATH Open1420.03069arXiv1608.01254MaRDI QIDQ4601031FDOQ4601031


Authors: Francis Adams, Douglas Cenzer Edit this on Wikidata


Publication date: 18 January 2018

Published in: Computability (Search for Journal in Brave)

Abstract: This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is Delta20 categorical. A structure A is said to be weakly ultrahomogeneous if there is a finite (exceptional) set of elements a1,dots,an such that A becomes ultrahomogeneous when constants representing these elements are added to the language. Characterizations are obtained for weakly ultrahomogeneous linear orderings, equivalence structures, injection structures and trees, and these are compared with characterizations of the computably categorical and Delta20 categorical structures. Index sets are used to determine the complexity of the notions of ultrahomegenous and weakly ultrahomogeneous for various families of structures.


Full work available at URL: https://arxiv.org/abs/1608.01254




Recommendations





Cited In (6)





This page was built for publication: Computability and categoricity of weakly ultrahomogeneous structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601031)