Computability and categoricity of weakly ultrahomogeneous structures
From MaRDI portal
Publication:4601031
Abstract: This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is categorical. A structure A is said to be weakly ultrahomogeneous if there is a finite (exceptional) set of elements 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 categorical structures. Index sets are used to determine the complexity of the notions of ultrahomegenous and weakly ultrahomogeneous for various families of structures.
Recommendations
Cited in
(6)- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
- Computability and categoricity of ultrahomogeneous structures
- Effective algebraicity
- Categoricity spectra of computable structures
- Omega-categorical structures and their algebraic invariants
- Computability-theoretic properties of injection structures
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)