# Bi‐embeddability spectra and bases of spectra

@article{Fokina2018BiembeddabilitySA,
title={Bi‐embeddability spectra and bases of spectra},
author={Ekaterina B. Fokina and Dino Rossegger and Luca San Mauro},
journal={Mathematical Logic Quarterly},
year={2018},
volume={65}
}
• Published 16 August 2018
• Mathematics, Computer Science
• Mathematical Logic Quarterly
We study degree spectra of structures with respect to the bi‐embeddability relation. The bi‐embeddability spectrum of a structure is the family of Turing degrees of its bi‐embeddable copies. To facilitate our study we introduce the notions of bi‐embeddable triviality and basis of a spectrum. Using bi‐embeddable triviality we show that several known families of degrees are bi‐embeddability spectra of structures. We then characterize the bi‐embeddability spectra of linear orderings and study…
11 Citations
Abstract We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by these relations. We first give a
Primary bi-embeddability spectra, the collection of Turing degrees of elementary bi- embeddable structures, are studied and examples of such spectra are given.
• Mathematics, Computer Science
Comput.
• 2021
The bi-embeddable categoricity spectrum of a structure $\mathcal A$ is defined as the family of Turing degrees that compute embeddings between any computable bi- embeddable copies of $\math Cal A$; the degree of bi- embeddeddable categorics is the least degree in this spectrum (if it exists).
• Mathematics, Computer Science
Ann. Pure Appl. Log.
• 2022
• Mathematics
Algebra and Logic
• 2018
We study the algorithmic complexity of isomorphic embeddings between computable structures. Suppose that L is a language. We say that L -structures A and B are bi-embeddable (denoted A ≈ B ) if there
• Mathematics, Computer Science
Arch. Math. Log.
• 2019
It is proved that computable equivalence structures have degree of bi-embeddable categoricity, and it is shown that the notions of $$Delta ^0_\alpha$$Δα0 bi- embeddableategoricity and relative $$Delta ^0-\alpha$$ coincide for equivalence structure for $$alpha =1,2,3$$α=1, 2,3.
• Mathematics
Journal of Mathematical Sciences
• 2022
We study computable reducibility for computable isomorphic copies of the standard ordering of natural numbers. Following Andrews and Sorbi, we isolate the class of self-full degrees inside the
• Materials Science
Algebra and Logic
• 2019
A standard way to capture the inherent complexity of the isomorphism type of a countable structure is to consider the set of all Turing degrees relative to which the given structure has a computable
• Materials Science
Archive for Mathematical Logic
• 2018
We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative)
• Mathematics, Computer Science
Algebra i logika
• 2019
The degree spectrum of a theory is generalized to arbitrary equivalence relations iff the Σn theories of A and B coincide and study degree spectra with respect to ≡∑n$${\equiv}_{\sum_n}$$.

## References

SHOWING 1-10 OF 34 REFERENCES

Primary bi-embeddability spectra, the collection of Turing degrees of elementary bi- embeddable structures, are studied and examples of such spectra are given.
• Mathematics
Algebra and Logic
• 2018
We study the algorithmic complexity of isomorphic embeddings between computable structures. Suppose that L is a language. We say that L -structures A and B are bi-embeddable (denoted A ≈ B ) if there
• Mathematics, Computer Science
Arch. Math. Log.
• 2019
It is proved that computable equivalence structures have degree of bi-embeddable categoricity, and it is shown that the notions of $$Delta ^0_\alpha$$Δα0 bi- embeddableategoricity and relative $$Delta ^0-\alpha$$ coincide for equivalence structure for $$alpha =1,2,3$$α=1, 2,3.
• Mathematics
• 2014
We introduce the notion of a degree spectrum of a complete theory to be the set of Turing degrees that contain a copy of some model of the theory. We generate examples showing that not all degree
• Mathematics
The Journal of Symbolic Logic
• 2016
It is shown that for degrees a from the interval [0′, 0″], such a structure exists if a′ = 0″, and there are no such structures if a″ > 0‴.
Theorem 1.1 (Greenberg, Montalbán and Slaman, and). (1) For the countable structures of partial ordering language, there is a linear ordering structure M so that Spec∼=,h(M) = {y | y is not
We argue for the existence of structures with the spectrum {x : x ≰ a} of degrees, where a is an arbitrary low degree. Also it is stated that there exist structures with the spectrum of degrees, {x :
• Chemistry, Mathematics
Math. Log. Q.
• 2010
The degree spectra of structures in which different types of immunity conditions are encoded are analyzed and show the existence of an almost computable structure of which the complement of the degree spectrum is uncountable.
• Mathematics
Algebra and Logic
• 2018
It is proved that for every countable structure A and a computable successor ordinal α there is a countable structure A−α which is ≤Σ ‐least among all countable structures C such that A is
• Mathematics
• 2004
When bounds on complexity of some aspect of a structure are preserved under isomorphism, we refer to them as intrinsic. Here, building on work of Soskov [33], [34], we give syntactical conditions