@article {alvir2018,
	title = {The Complexity of Scott Sentences of Scattered Linear Orderings},
	year = {Submitted},
	url = {https://arxiv.org/abs/1810.11423},
	author = {Alvir, Rachael and Rossegger, Dino}
}
@article {bazhenov2019,
	title = {Degrees of Bi-Embeddable Categoricity},
	year = {Submitted},
	abstract = {We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure \$\textbackslashmathcal A\$ as the family of Turing degrees that compute embeddings between any computable bi-embeddable copies of \$\textbackslashmathcal A\$; the degree of bi-embeddable categoricity of \$\textbackslashmathcal A\$ is the least degree in this spectrum (if it exists). We extend many known results about categoricity spectra to the case of bi-embeddability. In particular, we exhibit structures without degree of bi-embeddable categoricity, and we show that every degree d.c.e. above \$\textbackslashmathbf{0}\^{(\textbackslashalpha)}\$ for \$\textbackslashalpha\$ a computable successor ordinal and \$\textbackslashmathbf{0}\^{(\textbackslashlambda)}\$ for \$\textbackslashlambda\$ a computable limit ordinal is a degree of bi-embeddable categoricity. We also give examples of families of degrees that are not bi-embeddable categoricity spectra.},
	keywords = {03C57, 03D45, Mathematics - Logic},
	url = {http://arxiv.org/abs/1907.03553},
	author = {Bazhenov, Nikolay and Fokina, Ekaterina and Rossegger, Dino and Mauro, Luca San}
}
@article {fokina2019,
	title = {Bi-Embeddability Spectra and Bases of Spectra},
	journal = {Mathematical Logic Quarterly},
	year = {2019},
	url = {https://doi.org/10.1002/malq.201800056},
	author = {Fokina, Ekaterina and Rossegger, Dino and San Mauro, Luca}
}
@article {bazhenov2018,
	title = {Computable Bi-Embeddable Categoricity},
	journal = {Algebra and Logic},
	year = {2018},
	issn = {1573-8302},
	doi = {10.1007/s10469-018-9511-8},
	author = {Bazhenov, N. A. and Fokina, E. B. and Rossegger, D. and San Mauro, L.}
}
@article {bazhenov2018a,
	title = {Degrees of Bi-Embeddable Categoricity of Equivalence Structures},
	journal = {Archive for Mathematical Logic},
	year = {2018},
	keywords = {03C57, Bi-embeddability, Computable categoricity, Degrees of bi-embeddable categoricity, Degrees of categoricity},
	issn = {1432-0665},
	doi = {10.1007/s00153-018-0650-3},
	url = {https://doi.org/10.1007/s00153-018-0650-3},
	author = {Bazhenov, Nikolay and Fokina, Ekaterina and Rossegger, Dino and San Mauro, Luca}
}
@conference {rossegger2018,
	title = {Elementary Bi-Embeddability Spectra of Structures},
	booktitle = {Computability in Europe},
	series = {Lecture {Notes in {Computer Science},
	volume = {10936},
	year = {2018},
	pages = {349-358},
	publisher = {Springer},
	organization = {Springer},
	doi = {10.1007/978-3-319-94418-0_35},
	author = {Rossegger, Dino}
}
@article {fokina2018,
	title = {Measuring the Complexity of Reductions between Equivalence Relations},
	journal = {Computability},
	volume = {Preprint},
	number = {Preprint},
	year = {2018},
	pages = {1-16},
	abstract = {Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibil},
	issn = {2211-3568},
	doi = {10.3233/COM-180100},
	url = {https://arxiv.org/abs/1806.10363},
	author = {Fokina, Ekaterina and Rossegger, Dino and San Mauro, Luca}
}
@conference {bazhenov2017,
	title = {Computable Bi-Embeddable Categoricity of Equivalence Structures},
	booktitle = {Proc. of the 11th Panhellenic Logic Symposium},
	year = {2017},
	pages = {126-132},
	address = {Delfi, Greece},
	author = {Bazhenov, Nikolay and Fokina, Ekaterina and Rossegger, Dino and San Mauro, Luca}
}
@conference {fokina2017,
	title = {Degree Spectra of Structures with Respect to the Bi-Embeddability Relation},
	booktitle = {Proc. of the 11th Panhellenic Logic Symposium},
	year = {2017},
	pages = {32-38},
	address = {Delfi, Greece},
	author = {Fokina, Ekaterina and Rossegger, Dino and San Mauro, Luca}
}
@article {rossegger2017,
	title = {On Functors Enumerating Structures},
	journal = {Siberian Electronic Mathematical Reports},
	volume = {14},
	year = {2017},
	pages = {690-702},
	keywords = {Latex, \#latex},
	doi = {10.17377/semi.2017.14.059},
	url = {http://semr.math.nsc.ru/v14/p690-702.pdf},
	author = {Rossegger, Dino}
}
@conference {fokina2017a,
	title = {Reducibility and Bi-Reducibility Spectra of Equivalence Relations},
	booktitle = {Proc. of the 11th Panhellenic Logic Symposium},
	year = {2017},
	pages = {83-89},
	address = {Delfi, Greece},
	author = {Fokina, Ekaterina and Rossegger, Dino and San Mauro, Luca}
}
