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.
S.T.Fedoryaev, “Algorithmic reducibilities in Effective Model Theory and their structural properties”, to appear, 1996 (Published online)
4.
C.S.Goncharov, K.V.Adaricheva, P.E.Alaev, S.T.Fedoryaev i dr, “Algoritmicheskie i strukturnye svoistva modelei”, Otchet NIR/NIOKR # 96-01-01525 (Rossiiskii fond fundamentalnykh issledovanii), 1996
5.
S.T.Fedoryaev, “Recursively inconsistent algorithmic problems on 1-constructivizable relatively complemented distributive lattices”, Algebra and Logic, 34:6 (1996), 371-378
6.
J.Blanck, S.T.Fedoryaev, V.Stoltenberg-Hansen, “Nonequivalent effective representations of domains”, to appear (Uppsala University, Sweden), 1995, 34p (Published online)
7.
S.T.Fedoryaev, “Decidable algorithmic problems on relatively complemented distributive lattices which cannot be simultaneously decidable”, Bulletin of Symbolic Logic, 1:1 (1995), 109
8.
S.T.Fedoryaev, “Countability of widths of algebraic reducibility structures for models in some classes”, Mathematical Logic and Algorithm Theory, Proceed of Institute of mathematics of SB RAS, 25, Institute of Mathematics, SB RAN, Novosibirsk, 1993, 133-154
9.
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
10.
S.T.Fedoryaev, “Decidable algorithmic problems, which cannot be simultaneously decidable”, Proceed. III International conference on algebra (Krasnoyarsk, 1993), 1993, 345-346
11.
S.T.Fedoryaev, “Decidable algorithmic problems on relatively complemented distributive lattices which cannot be simultaneously decidable”, Logic Colloquium’92 (Keele, England), 1993
12.
S. T. Fedoryaev, “Countability of the width of structures of algebraic reducibility for models of some classes”, Trudy Inst. Mat. SO RAN, 25 (1993), 133–154
13.
S.T.Fedoryaev, “Some properties of algebraic reducibility of constructivizations”, Algebra and Logic, 29 (1990), 395-405
14.
S.T.Fedoryaev, “Some properties of algebraic reducibility of constructivizations”, Algebra and Logic, 29 (1990), 395-405
S.T.Fedoryaev, “O schetnosti shiriny struktur algebraicheskoi svodimosti dlya modelei nekotorykh klassov”, Tezisy dokladov X Vsesoyuz. konf. po matem. logike (Alma-Ata, noyabr 1990), Nauka, 1990, 155
16.
S.T.Fedoryaev, “Some properties of algebraic reducibility of constructivizations”, Proc. Third Logical Biennial Kleene'90 (Sofia, Bulgaria, June 1990), 1990, 24-25
17.
S.T.Fedoryaev, “Constructivizable models with linear structure of algebraic reducibility”, Mathematical notes of the Academy of Sciences of the USSR, 48 (1990), 1245-1249
18.
S.T.Fedoryaev, “Constructivizable models with linear structure of algebraic reducibility”, Mathematical notes of the Academy of Sciences of the USSR, 48 (1990), 1245-1249
Contact us: