Speciality:
01.01.06 (Mathematical logic, algebra, and number theory)
E-mail: Keywords: model, enumeration, computability, constructivization (computable enumeration), constructive model, automorphism, stable relation of model; algebraic, programm and uniform Uspensky's redusibilities, autoredusibility; algorithmic dimensions, and structure of algorithmic redusibilities.
UDC: 510.53, 510.67
Subject:
Theory of algorithms, recursive model theory, computability. Applications in theoretical computer science.
Main publications:
S.T.Fedoryaev, “Rekursivno nesovmestnye algoritmicheskie problemy na 1-konstruktiviziruemykh distributivnykh reshetkakh s otnositelnymi dopolneniyami”, Algebra i logika, 34:6 (1995), 667-680.
S.T.Fedoryaev, “Countability of widths of algebraic reducibility structures for models in some classes”, Siberian Advances in Mathematics, 3:2, Allerton Press (1993), 81-103.
S.T.Fedoryaev, “Konstruktiviziruemye modeli s lineinoi strukturoi algebraicheskoi svodimosti”, Mat. zametki, 48:48 (1990), 106-111.
