default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIskander Sh. Kalimullin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j30]Iskander Sh. Kalimullin, Steffen Lempp
, Keng Meng Ng, Mars M. Yamaleev:
On cupping and Ahmad Pairs. J. Symb. Log. 89(3): 1358-1369 (2024)- 2023
- [j29]Jun Le Goh, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova:
Pa Relative to an Enumeration Oracle. J. Symb. Log. 88(4): 1497-1525 (2023) - 2022
- [j28]Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. Comput. 11(3-4): 163 (2022) - [j27]Hristo Aleksndrov Ganchev, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova:
A Structural Dichotomy in the Enumeration Degrees. J. Symb. Log. 87(2): 527-544 (2022) - 2021
- [j26]Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán:
Punctual definability on structures. Ann. Pure Appl. Log. 172(8): 102987 (2021) - 2020
- [j25]Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky:
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112: 1-12 (2020) - [j24]Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Online presentations of finitely generated structures. Theor. Comput. Sci. 844: 195-216 (2020) - 2019
- [j23]Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov:
Foundations of Online Structure Theory. Bull. Symb. Log. 25(2): 141-181 (2019) - [j22]Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. 84(4): 1630-1669 (2019) - [j21]Marat Kh. Faizrahmanov, Asher M. Kach, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko:
Jump inversions of algebraic structures and Σ-definability. Math. Log. Q. 65(1): 37-45 (2019) - 2018
- [j20]Nikolay Bazhenov, Iskander Sh. Kalimullin, Mars M. Yamaleev:
Degrees of Categoricity and spectral Dimension. J. Symb. Log. 83(1): 103-116 (2018) - 2017
- [j19]Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko:
The Least ∑-jump Inversion Theorem for n-families. J. Univers. Comput. Sci. 23(6): 529-538 (2017) - [j18]Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Algebraic structures computable without delay. Theor. Comput. Sci. 674: 73-98 (2017) - 2016
- [j17]Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán:
The complements of Lower cones of Degrees and the degree spectra of Structures. J. Symb. Log. 81(3): 997-1006 (2016) - [j16]Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin:
The Enumeration Spectrum Hierarchy of α-families and Lowα Degrees. J. Univers. Comput. Sci. 22(7): 943-955 (2016) - [j15]Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin:
The enumeration spectrum hierarchy of n-families. Math. Log. Q. 62(4-5): 420-426 (2016) - [j14]Ekaterina B. Fokina, Andrey N. Frolov, Iskander Sh. Kalimullin:
Categoricity Spectra for Rigid Structures. Notre Dame J. Formal Log. 57(1): 45-57 (2016) - 2015
- [j13]Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin:
Limitwise monotonic sets of reals. Math. Log. Q. 61(3): 224-229 (2015) - 2012
- [j12]Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin:
Turing and enumeration jumps in the Ershov hierarchy. J. Log. Comput. 22(4): 737-743 (2012) - [j11]Andrey N. Frolov, Iskander Sh. Kalimullin, Valentina S. Harizanov, Oleg V. Kudinov, Russell G. Miller:
Spectra of highn and non-lown degrees. J. Log. Comput. 22(4): 755-777 (2012) - [j10]Iskander Sh. Kalimullin:
Algorithmic reducibilities of algebraic structures. J. Log. Comput. 22(4): 831-843 (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]Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russell G. Miller:
Degrees of categoricity of computable structures. Arch. Math. Log. 49(1): 51-67 (2010) - [j7]Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp:
On Downey's conjecture. J. Symb. Log. 75(2): 401-441 (2010) - [j6]Barbara F. Csima, Iskander Sh. Kalimullin:
Degree spectra and immunity properties. Math. Log. Q. 56(1): 67-77 (2010) - 2009
- [j5]Iskander Sh. Kalimullin:
Enumeration Degrees and Enumerability of Familes. J. Log. Comput. 19(1): 151-158 (2009) - 2007
- [j4]Iskander Sh. Kalimullin:
Elementary differences between the (2p)-c. e. and the (2p+1)-c. e. enumeration degrees. J. Symb. Log. 72(1): 277-284 (2007) - 2003
- [j3]Iskander Sh. Kalimullin:
Definability of the jump operator in the Enumeration Degrees. J. Math. Log. 3(2) (2003) - 2002
- [j2]Iskander Sh. Kalimullin:
Splitting Properties of n-C.E. Enumeration Degrees. J. Symb. Log. 67(2): 537-546 (2002) - 2001
- [j1]Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi:
Density results in the Delta20 e-degrees. Arch. Math. Log. 40(8): 597-614 (2001)
Conference and Workshop Papers
- 2019
- [c6]Iskander Sh. Kalimullin, Russell G. Miller, Hans Schoutens:
Degree Spectra for Transcendence in Fields. CiE 2019: 205-216 - 2017
- [c5]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 - 2009
- [c4]Andrey N. Frolov, Iskander Sh. Kalimullin, Russell G. Miller:
Spectra of Algebraic Fields and Subfields. CiE 2009: 232-241 - 2008
- [c3]Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Total Degrees and Nonsplitting Properties of Enumeration Degrees. TAMC 2008: 568-578 - 2007
- [c2]Iskander Sh. Kalimullin:
Some Notes on Degree Spectra of the Structures. CiE 2007: 389-397 - 2005
- [c1]Iskander Sh. Kalimullin:
On the Problems of Definability in the Enumeration Degrees. CiE 2005: 221-222
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-12-02 22:30 CET 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:
