Effective Embeddings for Pairs of Structures

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. We show that computable embeddings induce a non-trivial degree structure for two-element classes consisting of computable structures, in particular the pair of linear orders { ω, ω⋆}, which are the order types of the positive integers and the negative integers, respectively.

Cite

CITATION STYLE

APA

Bazhenov, N., Ganchev, H., & Vatev, S. (2019). Effective Embeddings for Pairs of Structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11558 LNCS, pp. 84–95). Springer Verlag. https://doi.org/10.1007/978-3-030-22996-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free