On the complexity of formulas in semantic programming SS Ospichev, DK Ponomarev
Сибирские электронные математические известия 15 (0), 987-995, 2018
17 2018 Computable family of Σ− 1 a-sets without Friedberg numberings S Ospichev
6th Conference on Computability in Eueope, CiE, 311-315, 2010
15 2010 Friedberg numberings in the Ershov hierarchy SS Ospichev
Algebra and Logic 54 (4), 283-296, 2015
14 2015 The expressiveness of looping terms in the semantic programming S Goncharov, S Ospichev, D Ponomaryov, D Sviridenko
arXiv preprint arXiv:1912.02731, 2019
9 2019 Infinite family of SS Ospichev
Siberian Journal of Pure and Applied Mathematics 11 (2), 89-92, 2011
8 * 2011 Some properties of numberings in various levels in Ershov's hierarchy SS Ospichev
Siberian Journal of Pure and Applied Mathematics 10 (4), 125-132, 2010
7 * 2010 Isomorphism types of Rogers semilattices in the analytical hierarchy N Bazhenov, S Ospichev, M Yamaleev
ASPECTS OF COMPUTATION AND AUTOMATA THEORY WITH APPLICATIONS, 97-114, 2024
5 2024 Numberings in the analytical hierarchy NA Bazhenov, M Mustafa, SS Ospichev, MM Yamaleev
Algebra and Logic 59, 404-407, 2020
5 2020 Rogers semilattices of punctual numberings N Bazhenov, M Mustafa, S Ospichev
Mathematical Structures in Computer Science 32 (2), 164-188, 2022
3 2022 Families with Infinite Rogers Semilattices in Ershov Hierarchy S Ospichev
CiE‐2011, Abstract and Handout Booklet.–Sofia: Bulgaria, 174-179, 2011
3 2011 Semilattices of punctual numberings N Bazhenov, M Mustafa, S Ospichev
International Conference on Theory and Applications of Models of Computation …, 2020
2 2020 Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings. S Ospichev
Journal of Mathematical Sciences 215 (4), 2016
2 2016 How to approximate fuzzy sets: mind-changes and the Ershov Hierarchy N Bazhenov, M Mustafa, S Ospichev, L San Mauro
Synthese 201 (2), 55, 2023
1 2023 Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy N Bazhenov, M Mustafa, S Ospichev, L San Mauro
International Workshop on Logic, Rationality and Interaction, 1-13, 2021
1 2021 On universal pairs in the Ershov hierarchy NA Bazhenov, M Mustafa, SS Ospichev
Siberian Mathematical Journal 62 (1), 23-31, 2021
2021 Bounded Reducibility for Computable Numberings N Bazhenov, M Mustafa, S Ospichev
Conference on Computability in Europe, 96-107, 2019
2019 Friedberg numberings of families of partial computable functionals SS Ospichev
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic …, 2019
2019 Computable families of sets in Ershov hierarchy without principal numberings SS Ospichev
Siberian Journal of Pure and Applied Mathematics 15 (1), 54-62, 2015
2015 Numberings in the Analytical Hierarchy MM Yamaleev, SS Ospichev, NA Bazhenov, M Mustafa
Nikolay BazhenovSobolev Institute of MathematicsПодтвержден адрес электронной почты в домене math.nsc.ru
