default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarat M. Arslanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j13]Marat M. Arslanov
:
Splitting and non-splitting in the difference hierarchy. Math. Struct. Comput. Sci. 28(3): 384-391 (2018)- 2017
- [j12]Chingiz Kenshimov, Loukas Bampis, Beibut Amirgaliyev, Marat M. Arslanov, Antonios Gasteratos:
Deep learning features exception for cross-season visual place recognition. Pattern Recognit. Lett. 100: 124-130 (2017) - [c3]Marat M. Arslanov, Iskander Sh. Kalimullin:
A Survey of Results on the d-c.e. and n-c.e. Degrees. Computability and Complexity 2017: 469-478 - 2013
- [j11]Marat M. Arslanov:
Definable relations in Turing degree structures. J. Log. Comput. 23(6): 1145-1154 (2013) - 2012
- [j10]Marat M. Arslanov:
Model-theoretic properties of the n-c.e. degrees. J. Log. Comput. 22(4): 669-677 (2012) - 2011
- [j9]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Splitting and nonsplitting in the Σ20 enumeration degrees. Theor. Comput. Sci. 412(18): 1669-1685 (2011) - 2010
- [j8]Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp:
On Downey's conjecture. J. Symb. Log. 75(2): 401-441 (2010)
2000 – 2009
- 2008
- [j7]Marat M. Arslanov, Ilnur I. Batyrshin, Roland Sh. Omanadze:
Structural properties of Q-degrees of n-c. e. sets. Ann. Pure Appl. Log. 156(1): 13-20 (2008) - [c2]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Total Degrees and Nonsplitting Properties of Enumeration Degrees. TAMC 2008: 568-578 - 2005
- [j6]Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang:
The minimal e-degree problem in fragments of Peano arithmetic. Ann. Pure Appl. Log. 131(1-3): 159-175 (2005) - 2004
- [j5]Marat M. Arslanov, S. Barry Cooper, Angsheng Li:
There is no low maximal d. c. e. degree - Corrigendum. Math. Log. Q. 50(6): 628-636 (2004) - 2001
- [j4]Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi:
Density results in the Delta20 e-degrees. Arch. Math. Log. 40(8): 597-614 (2001) - 2000
- [j3]Marat M. Arslanov, S. Barry Cooper, Angsheng Li:
There is No Low Maximal D.C.E. Degree. Math. Log. Q. 46(3): 409-416 (2000)
1990 – 1999
- 1998
- [j2]Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman:
Relative Enumerability in the Difference Hierarchy. J. Symb. Log. 63(2): 411-420 (1998) - 1996
- [j1]Marat M. Arslanov, Steffen Lempp, Richard A. Shore:
Interpolating d-r.e. and REA Degrees between r.e. Degrees. Ann. Pure Appl. Log. 78(1-3): 29-56 (1996)
1980 – 1989
- 1987
- [c1]Marat M. Arslanov:
The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets. FCT 1987: 34-37
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
