SPECTRA OF STRUCTURES AND RELATIONS.

We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (as a relation on S). We show that the computable dense linear order L is universal for all countable linear orders under thi...

Descripción completa

Detalles Bibliográficos

Publicado en:	Journal of Symbolic Logic Vol. 72; no. 1; pp. 324 - 349
Autores principales:	Harizanov, Valentina S., Miller, Russell G.
Formato:	Artículo
Publicado:	Cambridge University Press Mar2007
Materias:	Turing (Computer program language) Embeddings (Mathematics) Unary algebras Mathematical logic Isomorphism (Mathematics) Automorphisms Graph theory Boolean algebra
Acceso en línea:	Ver este registro en EBSCOhost