The following pages link to Iskander Sh. Kalimullin (Q1407512):
Displayed 50 items.
- Item:Q1407512 (redirect page) (← links)
- Reducibility on families (Q431669) (← links)
- Item:Q1407512 (redirect page) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Relations between algorithmic reducibilities of algebraic systems (Q735978) (← links)
- Constructing punctually categorical semigroups (Q828124) (← links)
- A hierarchy of classes of families and \(n\)-low degrees (Q904326) (← links)
- Density results in the \(\Delta_2^0\) e-degrees (Q1407513) (← links)
- Positive presentations of families relative to \(e\)-oracles (Q1617982) (← links)
- Jump inversions of algebraic structures and the \({\Sigma}\)-definability (Q1620784) (← links)
- Item:Q1407512 (redirect page) (← links)
- The diversity of categoricity without delay (Q1688181) (← links)
- Positive presentations of families in relation to reducibility with respect to enumerability (Q1731525) (← links)
- Primitive recursive fields and categoricity (Q2011324) (← links)
- Punctual categoricity relative to a computable oracle (Q2030137) (← links)
- Punctual definability on structures (Q2033006) (← links)
- Degrees of enumerations of countable Wehner-like families (Q2036467) (← links)
- Punctual categoricity spectra of computably categorical structures (Q2055311) (← links)
- Punctual structures and primitive recursive reducibility (Q2172879) (← links)
- Degree spectra for transcendence in fields (Q2179363) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Positive numberings in admissible sets (Q2191379) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- Strong degrees of categoricity and weak density (Q2211365) (← links)
- Computable positive and Friedberg numberings in hyperarithmetic (Q2213918) (← links)
- Semidecidable numberings in admissible sets (Q2213938) (← links)
- Maximality and minimality under limitwise monotonic reducibility (Q2263113) (← links)
- Partial decidable presentations in hyperarithmetic (Q2332068) (← links)
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees (Q2361673) (← links)
- Degrees of categoricity vs. strong degrees of categoricity (Q2364297) (← links)
- Computable embeddings of classes of structures under enumeration and Turing operators (Q2412951) (← links)
- Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees (Q2430010) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- Degrees of relative computable categoricity (Q2680583) (← links)
- (Q2713991) (← links)
- (Q2784777) (← links)
- The enumeration spectrum hierarchy of<i>n</i>-families (Q2827955) (← links)
- Limitwise monotonic sequences and degree spectra of structures (Q2845476) (← links)
- Turing and enumeration jumps in the Ershov hierarchy (Q2907052) (← links)
- Algorithmic reducibilities of algebraic structures (Q2907058) (← links)
- A Survey of Results on the d-c.e. and n-c.e. Degrees (Q2970973) (← links)
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES (Q2976376) (← links)
- (Q3068301) (← links)
- Splitting properties of <i>n</i>-c.e. enumeration degrees (Q3149981) (← links)
- Degree spectra and immunity properties (Q3406451) (← links)
- Elementary differences between the (2<sub><i>p</i></sub>)-C. E. and the (2<sub><i>p</i></sub> +1)-c. e. enumeration degrees (Q3426574) (← links)
- Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees (Q3502679) (← links)
- Spectra of degrees of some structures (Q3546103) (← links)
- On Downey's conjecture (Q3570156) (← links)
- Almost computably enumerable families of sets (Q3600774) (← links)