Iskander Sh. Kalimullin

According to our database, Iskander Sh. Kalimullin authored at least 36 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On cupping and Ahmad Pairs.

Iskander Sh. Kalimullin, Steffen Lempp, Keng Meng Ng, Mars M. Yamaleev

J. Symb. Log., 2024

2023

Pa Relative to an Enumeration Oracle.

Jun Le Goh, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova

J. Symb. Log., 2023

2022

A Structural Dichotomy in the Enumeration Degrees.

Hristo Aleksndrov Ganchev, Iskander Sh. Kalimullin, Joseph S. Miller, Mariya Ivanova Soskova

J. Symb. Log., 2022

Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021.

Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova

Comput., 2022

2021

Punctual definability on structures.

Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán

Ann. Pure Appl. Log., 2021

2020

Online presentations of finitely generated structures.

Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng

Theor. Comput. Sci., 2020

Graphs are not universal for online computability.

Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky

J. Comput. Syst. Sci., 2020

2019

Jump inversions of algebraic structures and Σ-definability.

Marat Kh. Faizrahmanov, Asher M. Kach, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko

Math. Log. Q., 2019

Automatic and Polynomial-Time Algebraic Structures.

Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng

J. Symb. Log., 2019

Foundations of Online Structure Theory.

Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov

Bull. Symb. Log., 2019

Degree Spectra for Transcendence in Fields.

Iskander Sh. Kalimullin, Russell G. Miller, Hans Schoutens

Proceedings of the Computing with Foresight and Industry, 2019

2018

Degrees of Categoricity and spectral Dimension.

Nikolay Bazhenov, Iskander Sh. Kalimullin, Mars M. Yamaleev

J. Symb. Log., 2018

2017

Algebraic structures computable without delay.

Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng

Theor. Comput. Sci., 2017

The Least ∑-jump Inversion Theorem for <i>n</i>-families.

Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko

J. Univers. Comput. Sci., 2017

A Survey of Results on the d-c.e. and n-c.e. Degrees.

Marat M. Arslanov, Iskander Sh. Kalimullin

Proceedings of the Computability and Complexity, 2017

2016

Categoricity Spectra for Rigid Structures.

Ekaterina B. Fokina, Andrey N. Frolov, Iskander Sh. Kalimullin

Notre Dame J. Formal Log., 2016

The enumeration spectrum hierarchy of <i>n</i>-families.

Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin

Math. Log. Q., 2016

The Enumeration Spectrum Hierarchy of α-families and Low_α Degrees.

Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin

J. Univers. Comput. Sci., 2016

The complements of Lower cones of Degrees and the degree spectra of Structures.

Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán

J. Symb. Log., 2016

2015

Limitwise monotonic sets of reals.

Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin

Math. Log. Q., 2015

2012

Algorithmic reducibilities of algebraic structures.

Iskander Sh. Kalimullin

J. Log. Comput., 2012

Spectra of high<i>_n</i> and non-low<i>_n</i> degrees.

Andrey N. Frolov, Iskander Sh. Kalimullin, Valentina S. Harizanov, Oleg V. Kudinov, Russell G. Miller

J. Log. Comput., 2012

Turing and enumeration jumps in the Ershov hierarchy.

Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin

J. Log. Comput., 2012

2011

Splitting and nonsplitting in the Σ₂⁰ enumeration degrees.

Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova

Theor. Comput. Sci., 2011

2010

Degree spectra and immunity properties.

Barbara F. Csima, Iskander Sh. Kalimullin

Math. Log. Q., 2010

On Downey's conjecture.

Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp

J. Symb. Log., 2010

Degrees of categoricity of computable structures.

Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russell G. Miller

Arch. Math. Log., 2010

2009

Enumeration Degrees and Enumerability of Familes.

Iskander Sh. Kalimullin

J. Log. Comput., 2009

Spectra of Algebraic Fields and Subfields.

Andrey N. Frolov, Iskander Sh. Kalimullin, Russell G. Miller

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Total Degrees and Nonsplitting Properties of Enumeration Degrees.

Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova

Proceedings of the Theory and Applications of Models of Computation, 2008

2007

Elementary differences between the (2p)-c. e. and the (2p+1)-c. e. enumeration degrees.

Iskander Sh. Kalimullin

J. Symb. Log., 2007

Some Notes on Degree Spectra of the Structures.

Iskander Sh. Kalimullin

Proceedings of the Computation and Logic in the Real World, 2007

2005

On the Problems of Definability in the Enumeration Degrees.

Iskander Sh. Kalimullin

Proceedings of the New Computational Paradigms, 2005

2003

Definability of the jump operator in the Enumeration Degrees.

Iskander Sh. Kalimullin

J. Math. Log., 2003

2002

Splitting Properties of n-C.E. Enumeration Degrees.

Iskander Sh. Kalimullin

J. Symb. Log., 2002

2001

Density results in the Delta20 e-degrees.

Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi

Arch. Math. Log., 2001