2 citations · 2 across the 4 of their papers we have counts for
4 papers
An effective version of the Stone duality
Nikolay A. Bazhenov, Iskander Sh. Kalimullin, Marina V. Schwidefsky
The paper studies computability-theoretic aspects of topological -spaces. We introduce effective versions of the notions of a countable -poset and a (second-countable) topo…
Degrees of selector functions and relative computable categoricity
I. Sh. Kalimullin
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures…
Notes on degrees of relative computable categoricity
I. Sh. Kalimullin
We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Un…
Degree spectra for transcendence in fields
Iskander Kalimullin, Russell Miller, Hans Schoutens
We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any s…