×

zbMATH — the first resource for mathematics

Arslanov, Marat M.

Compute Distance To:
Author ID: arslanov.marat-m Recent zbMATH articles by "Arslanov, Marat M."
Published as: Arslanov, M.; Arslanov, M. M.; Arslanov, Marat; Arslanov, Marat M.
External Links: MGP · Wikidata · ORCID
Documents Indexed: 59 Publications since 1970, including 6 Books
Reviewing Activity: 92 Reviews

Publications by Year

Citations contained in zbMATH Open

33 Publications have been cited 117 times in 77 Documents Cited by Year
Splitting properties of total enumeration degrees. Zbl 1032.03037
Arslanov, M. M.; Kalimullin, I. Sh.; Cooper, S. Barry
11
2003
On some generalizations of a fixed point theorem. Zbl 0523.03029
Arslanov, M. M.
11
1981
On Downey’s conjecture. Zbl 1192.03017
Arslanov, Marat M.; Kalimullin, Iskander Sh.; Lempp, Steffen
10
2010
On isolating r.e. and isolated d-r.e. degrees. Zbl 0839.03024
Arslanov, Marat M.; Lempp, Steffen; Shore, Richard A.
10
1996
On the lattice of degrees below 0’. Zbl 0665.03034
Arslanov, M. M.
10
1988
There is no low maximal d. c. e. degree. Zbl 0967.03037
Arslanov, Marat; Cooper, S. Barry; Li, Angsheng
8
2000
Relative enumerability in the difference hierarchy. Zbl 0911.03021
Arslanov, Marat M.; LaForte, Geoffrey L.; Slaman, Theodore A.
8
1998
Q-degrees of \(n\)-c.e. sets. Zbl 1147.03023
Arslanov, M. M.; Omanadze, R. Sh.
5
2007
The Ershov hierarchy. Zbl 1279.03067
Arslanov, Marat M.
4
2011
Density results in the \(\Delta_2^0\) e-degrees. Zbl 1042.03033
Arslanov, Marat M.; Kalimullin, Iskander Sh.; Sorbi, Andrea
4
2001
Relative splittings of \(\mathbf 0_e\prime\) in the \(\Delta_2^0\)-enumeration degrees. Zbl 0951.03034
Arslanov, Marat M.; Sorbi, Andrea
4
2000
Structural properties of \(Q\)-degrees of n-c.e. sets. Zbl 1154.03023
Arslanov, M. M.; Batyrshin, I. I.; Omanadze, R. Sh.
3
2008
Recursively enumerable sets and degrees of unsolvability. Zbl 0648.03028
Arslanov, M. M.
3
1986
A note on minimal and maximal ideals of ordered semigroups. Zbl 1015.06015
Arslanov, M.; Kehayopulu, N.
2
2002
Recursion theory and complexity. Proceedings of the Kazan ’97 workshop, Kazan, Russia, July 14–19, 1997. Zbl 0923.00014
Arslanov, Marat M. (ed.); Lempp, Steffen (ed.)
2
1999
Interpolating \(d\)-r.e. and REA degrees between r.e. degrees. Zbl 0855.03025
Arslanov, Marat; Lempp, Steffen; Shore, Richard A.
2
1996
Completeness in the arithmetical hierarchy and fixed points. Zbl 0692.03030
Arslanov, M. M.
2
1989
Lattice properties of degrees below O’. Zbl 0596.03040
Arslanov, M. M.
2
1985
A criterion for the completeness of recursively enumerable sets and some generalizations of the fixed point theorem. Zbl 0358.02046
Arslanov, M. M.; Nadyrov, R. F.; Solov’ev, V. D.
2
1977
On the doubly connected domination polynomial of a graph. Zbl 1414.05150
Akhbari, M. H.; Movahedi, F.; Arslanov, M.
1
2019
On the problem of definability of the computably enumerable degrees in the difference hierarchy. Zbl 06945060
Arslanov, M. M.; Yamaleev, M. M.
1
2018
A survey of results on the d-c.e. and n-c.e. degrees. Zbl 06700073
Arslanov, Marat M.; Kalimullin, Iskander Sh.
1
2017
Definable relations in Turing degree structures. Zbl 1327.03032
Arslanov, Marat M.
1
2013
Model-theoretic properties of Turing degrees in the Ershov difference hierarchy. Zbl 1361.03038
Arslanov, M. M.
1
2012
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees. Zbl 1251.03045
Arslanov, M. M.; Cooper, S. B.; Kalimullin, I. Sh.; Soskova, M. I.
1
2011
Definability and elementary equivalence in the Ershov difference hierarchy. Zbl 1191.03029
Arslanov, Marat M.
1
2009
Total degrees and nonsplitting properties of \(\Sigma_2^0\) enumeration degrees. Zbl 1140.03021
Arslanov, M. M.; Cooper, S. Barry; Kalimullin, I. Sh.; Soskova, M. I.
1
2008
Open questions about the \(n\)-c. e. degrees. Zbl 0967.03036
Arslanov, Marat
1
2000
Degree structures in local degree theory. Zbl 0884.03045
Arslanov, Marat
1
1997
On the structure of degrees below \(0'\). Zbl 0709.03034
Arslanov, Marat M.
1
1990
Lattice of degrees below \(O'\). Zbl 0675.03025
Arslanov, M. M.
1
1988
Families of recursively enumerable sets and their degrees of unsolvability. Zbl 0615.03030
Arslanov, M. M.
1
1985
A class of hypersimple incomplete sets. Zbl 0597.03024
Arslanov, M. M.
1
1985
On the doubly connected domination polynomial of a graph. Zbl 1414.05150
Akhbari, M. H.; Movahedi, F.; Arslanov, M.
1
2019
On the problem of definability of the computably enumerable degrees in the difference hierarchy. Zbl 06945060
Arslanov, M. M.; Yamaleev, M. M.
1
2018
A survey of results on the d-c.e. and n-c.e. degrees. Zbl 06700073
Arslanov, Marat M.; Kalimullin, Iskander Sh.
1
2017
Definable relations in Turing degree structures. Zbl 1327.03032
Arslanov, Marat M.
1
2013
Model-theoretic properties of Turing degrees in the Ershov difference hierarchy. Zbl 1361.03038
Arslanov, M. M.
1
2012
The Ershov hierarchy. Zbl 1279.03067
Arslanov, Marat M.
4
2011
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees. Zbl 1251.03045
Arslanov, M. M.; Cooper, S. B.; Kalimullin, I. Sh.; Soskova, M. I.
1
2011
On Downey’s conjecture. Zbl 1192.03017
Arslanov, Marat M.; Kalimullin, Iskander Sh.; Lempp, Steffen
10
2010
Definability and elementary equivalence in the Ershov difference hierarchy. Zbl 1191.03029
Arslanov, Marat M.
1
2009
Structural properties of \(Q\)-degrees of n-c.e. sets. Zbl 1154.03023
Arslanov, M. M.; Batyrshin, I. I.; Omanadze, R. Sh.
3
2008
Total degrees and nonsplitting properties of \(\Sigma_2^0\) enumeration degrees. Zbl 1140.03021
Arslanov, M. M.; Cooper, S. Barry; Kalimullin, I. Sh.; Soskova, M. I.
1
2008
Q-degrees of \(n\)-c.e. sets. Zbl 1147.03023
Arslanov, M. M.; Omanadze, R. Sh.
5
2007
Splitting properties of total enumeration degrees. Zbl 1032.03037
Arslanov, M. M.; Kalimullin, I. Sh.; Cooper, S. Barry
11
2003
A note on minimal and maximal ideals of ordered semigroups. Zbl 1015.06015
Arslanov, M.; Kehayopulu, N.
2
2002
Density results in the \(\Delta_2^0\) e-degrees. Zbl 1042.03033
Arslanov, Marat M.; Kalimullin, Iskander Sh.; Sorbi, Andrea
4
2001
There is no low maximal d. c. e. degree. Zbl 0967.03037
Arslanov, Marat; Cooper, S. Barry; Li, Angsheng
8
2000
Relative splittings of \(\mathbf 0_e\prime\) in the \(\Delta_2^0\)-enumeration degrees. Zbl 0951.03034
Arslanov, Marat M.; Sorbi, Andrea
4
2000
Open questions about the \(n\)-c. e. degrees. Zbl 0967.03036
Arslanov, Marat
1
2000
Recursion theory and complexity. Proceedings of the Kazan ’97 workshop, Kazan, Russia, July 14–19, 1997. Zbl 0923.00014
Arslanov, Marat M. (ed.); Lempp, Steffen (ed.)
2
1999
Relative enumerability in the difference hierarchy. Zbl 0911.03021
Arslanov, Marat M.; LaForte, Geoffrey L.; Slaman, Theodore A.
8
1998
Degree structures in local degree theory. Zbl 0884.03045
Arslanov, Marat
1
1997
On isolating r.e. and isolated d-r.e. degrees. Zbl 0839.03024
Arslanov, Marat M.; Lempp, Steffen; Shore, Richard A.
10
1996
Interpolating \(d\)-r.e. and REA degrees between r.e. degrees. Zbl 0855.03025
Arslanov, Marat; Lempp, Steffen; Shore, Richard A.
2
1996
On the structure of degrees below \(0'\). Zbl 0709.03034
Arslanov, Marat M.
1
1990
Completeness in the arithmetical hierarchy and fixed points. Zbl 0692.03030
Arslanov, M. M.
2
1989
On the lattice of degrees below 0’. Zbl 0665.03034
Arslanov, M. M.
10
1988
Lattice of degrees below \(O'\). Zbl 0675.03025
Arslanov, M. M.
1
1988
Recursively enumerable sets and degrees of unsolvability. Zbl 0648.03028
Arslanov, M. M.
3
1986
Lattice properties of degrees below O’. Zbl 0596.03040
Arslanov, M. M.
2
1985
Families of recursively enumerable sets and their degrees of unsolvability. Zbl 0615.03030
Arslanov, M. M.
1
1985
A class of hypersimple incomplete sets. Zbl 0597.03024
Arslanov, M. M.
1
1985
On some generalizations of a fixed point theorem. Zbl 0523.03029
Arslanov, M. M.
11
1981
A criterion for the completeness of recursively enumerable sets and some generalizations of the fixed point theorem. Zbl 0358.02046
Arslanov, M. M.; Nadyrov, R. F.; Solov’ev, V. D.
2
1977

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.