The following pages link to Marat M. Arslanov (Q591972):
Displaying 50 items.
- On \(\Sigma\)-rigid presentations of the real order (Q404712) (← links)
- Definable relations in Turing degree structures (Q468086) (← links)
- Completeness in the arithmetical hierarchy and fixed points (Q583200) (← links)
- (Q588612) (redirect page) (← links)
- The most nonelementary theory (Q598194) (← links)
- Turing jumps in the Ershov hierarchy (Q695781) (← links)
- Positive undecidable numberings in the Ershov hierarchy (Q695803) (← links)
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- Types of resemblance and of recursive isomorphism of partial recursive functions (Q750426) (← links)
- Some properties of algebraic reducibility of constructivizations (Q810499) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- Structural theory of degrees of unsolvability: advances and open problems (Q904325) (← links)
- A high noncuppable \({\Sigma^0_2}\) \(e\)-degree (Q938229) (← links)
- Q-degrees of \(n\)-c.e. sets (Q938805) (← links)
- Structural properties of \(Q\)-degrees of n-c.e. sets (Q958482) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- Weak presentations of computable ordered semigroups (Q1022232) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- The pillars of computation theory. State, encoding, nondeterminism (Q1039511) (← links)
- On computable presentations of some functional lattices (Q1044671) (← links)
- A class of hypersimple incomplete sets (Q1078559) (← links)
- Computable Kripke models and intermediate logics (Q1271561) (← links)
- Complexity properties of recursively enumerable sets and \(sQ\)-completeness (Q1277538) (← links)
- What is computation? (Q1293030) (← links)
- Decidable Boolean algebras of low level (Q1295398) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- A generalization of Selivanov's theorem (Q1358035) (← links)
- Definability in the enumeration degrees (Q1387092) (← links)
- A note on minimal and maximal ideals of ordered semigroups (Q1394493) (← links)
- Density results in the \(\Delta_2^0\) e-degrees (Q1407513) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- The Kierstead's conjecture and limitwise monotonic functions (Q1709678) (← links)
- On the problem of definability of the computably enumerable degrees in the difference hierarchy (Q1785041) (← links)
- Effectively hyperimmune sets and majorants (Q1820774) (← links)
- Effective completeness theorems for modal logic (Q1877094) (← links)
- Shrinking games and local formulas (Q1877096) (← links)
- The completeness of arithmetic sets under operations of set theory (Q1902753) (← links)
- On minimal numerations (Q1914753) (← links)
- Automorphism groups of decidable models (Q1918792) (← links)
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees (Q1919759) (← links)
- The relationship between word complexity and computational complexity in subshifts (Q1995561) (← links)
- Nondeterminisic sublinear time has measure 0 in P (Q1999993) (← links)
- Fixed-point selection functions (Q2030128) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- \textit{CEA} operators and the ershov hierarchy (Q2234455) (← links)
- Recursion theory. Computational aspects of definability (Q2260474) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees (Q2361673) (← links)
