Iskander Sh. Kalimullin

From MaRDI portal
Revision as of 22:55, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Iskander Sh. Kalimullin to Iskander Sh. Kalimullin: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1407512

Available identifiers

zbMath Open kalimullin.iskander-shMaRDI QIDQ1407512

List of research outcomes





PublicationDate of PublicationType
Negative numberings in admissible sets. I2024-11-28Paper
Negative numberings in admissible sets. II2024-11-28Paper
On cupping and Ahmad pairs2024-11-25Paper
Marat Mirzaevich Arslanov (on his eightieth birthday)2024-11-15Paper
Degrees of selector functions and relative computable categoricity2024-11-08Paper
Numberings on admissible structures over equivalence relations2024-11-08Paper
PA RELATIVE TO AN ENUMERATION ORACLE2023-12-22Paper
Degrees of selector functions and relative computable categoricity2023-05-29Paper
Degrees of relative computable categoricity2023-01-04Paper
Punctual structures and primitive recursive reducibility2022-09-19Paper
Notes on degrees of relative computable categoricity2022-07-17Paper
A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES2022-06-15Paper
Punctual categoricity spectra of computably categorical structures2021-12-01Paper
Degrees of enumerations of countable Wehner-like families2021-06-29Paper
Punctual definability on structures2021-06-14Paper
Punctual categoricity relative to a computable oracle2021-06-07Paper
Constructing punctually categorical semigroups2021-01-08Paper
Semidecidable numberings in admissible sets2020-12-04Paper
Computable positive and Friedberg numberings in hyperarithmetic2020-12-03Paper
Strong degrees of categoricity and weak density2020-11-11Paper
Online presentations of finitely generated structures2020-10-21Paper
Positive numberings in admissible sets2020-06-24Paper
Graphs are not universal for online computability2020-06-09Paper
Degree spectra for transcendence in fields2020-05-12Paper
Jump inversions of algebraic structures and Σ‐definability2020-05-06Paper
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES2020-01-10Paper
Primitive recursive fields and categoricity2019-12-06Paper
Partial decidable presentations in hyperarithmetic2019-11-01Paper
FOUNDATIONS OF ONLINE STRUCTURE THEORY2019-08-01Paper
Positive presentations of families in relation to reducibility with respect to enumerability2019-03-13Paper
Jump inversions of algebraic structures and the \({\Sigma}\)-definability2018-11-14Paper
Positive presentations of families relative to \(e\)-oracles2018-11-13Paper
DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION2018-05-02Paper
Computable embeddings of classes of structures under enumeration and Turing operators2018-04-06Paper
The diversity of categoricity without delay2018-01-05Paper
Degrees of categoricity vs. strong degrees of categoricity2017-07-18Paper
Elementary theories and structural properties of d-c.e. and n-c.e. degrees2017-06-30Paper
Algebraic structures computable without delay2017-05-12Paper
THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES2017-04-28Paper
A Survey of Results on the d-c.e. and n-c.e. Degrees2017-04-04Paper
The enumeration spectrum hierarchy ofn-families2016-10-24Paper
A hierarchy of classes of families and \(n\)-low degrees2016-01-13Paper
Limitwise monotonic sets of reals2015-06-22Paper
Maximality and minimality under limitwise monotonic reducibility2015-03-17Paper
Limitwise monotonic sequences and degree spectra of structures2013-08-30Paper
Turing and enumeration jumps in the Ershov hierarchy2012-09-05Paper
Algorithmic reducibilities of algebraic structures2012-09-05Paper
Reducibility on families2012-06-29Paper
https://portal.mardi4nfdi.de/entity/Q53915532011-04-06Paper
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees2011-04-05Paper
https://portal.mardi4nfdi.de/entity/Q30683012011-01-13Paper
On Downey's conjecture2010-06-24Paper
Degree spectra and immunity properties2010-02-16Paper
Degrees of categoricity of computable structures2010-01-22Paper
Relations between algorithmic reducibilities of algebraic systems2009-10-26Paper
Enumeration Degrees and Enumerability of Familes2009-03-02Paper
Almost computably enumerable families of sets2009-02-05Paper
Spectra of degrees of some structures2008-12-18Paper
Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees2008-05-27Paper
Some Notes on Degree Spectra of the Structures2007-11-13Paper
Elementary differences between the (2p)-C. E. and the (2p +1)-c. e. enumeration degrees2007-03-12Paper
https://portal.mardi4nfdi.de/entity/Q54767712006-07-18Paper
New Computational Paradigms2006-01-11Paper
DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES2004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44493502004-02-09Paper
Density results in the \(\Delta_2^0\) e-degrees2003-09-16Paper
Splitting properties of n-c.e. enumeration degrees2003-03-31Paper
https://portal.mardi4nfdi.de/entity/Q27847772002-09-16Paper
https://portal.mardi4nfdi.de/entity/Q45332832002-06-09Paper
https://portal.mardi4nfdi.de/entity/Q27139912001-06-10Paper

Research outcomes over time

This page was built for person: Iskander Sh. Kalimullin