|
Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory, 2018, Volume 158, Pages 23–39
(Mi into411)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Degree spectra of structures
I. Sh. Kalimullina, V. L. Selivanovba, A. N. Frolova a Kazan (Volga Region) Federal University
b A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
In this survey, we discuss computability spectra of countable structures that provide a natural measure of noncomputability of a structure. This notion is a main tool of investigating algorithmic properties of countable structures. Along with a review of known results in this field, we present proofs of some new results to illustrate the method of interpretation which is a basic method of the field. We also discuss some remaining open questions.
Keywords:
structure, computable structure, spectrum of a structure, interpretation.
Citation:
I. Sh. Kalimullin, V. L. Selivanov, A. N. Frolov, “Degree spectra of structures”, Proceedings of the Seminar on Algebra and Mathematical Logic of the Kazan (Volga Region) Federal University, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 158, VINITI, Moscow, 2018, 23–39; J. Math. Sci. (N. Y.), 256:2 (2021), 143–159
Linking options:
https://www.mathnet.ru/eng/into411 https://www.mathnet.ru/eng/into/v158/p23
|
|