The following pages link to Valentina S. Harizanov (Q636348):
Displayed 50 items.
- Orbits of maximal vector spaces (Q282117) (← links)
- Spaces of orders and their Turing degree spectra (Q636350) (← links)
- \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures (Q639658) (← links)
- Item:Q636348 (redirect page) (← links)
- The computable embedding problem (Q695798) (← links)
- Dependence relations in computably rigid computable vector spaces (Q703839) (← links)
- On the learnability of vector spaces (Q859986) (← links)
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations (Q904324) (← links)
- Partial automorphism semigroups (Q998310) (← links)
- Chains and antichains in partial orderings (Q1005926) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- Some effects of Ash-Nerode and other decidability conditions on degree spectra (Q1182431) (← links)
- Uncountable degree spectra (Q1182483) (← links)
- The possible Turing degree of the nonzero member in a two element degree spectrum (Q1210135) (← links)
- Turing degrees of certain isomorphic images of computable relations (Q1295383) (← links)
- Turing degrees of hypersimple relations on computable structures (Q1399102) (← links)
- Simple and immune relations on countable structures (Q1407593) (← links)
- Item:Q636348 (redirect page) (← links)
- Item:Q1740456 (redirect page) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- Simple structures with complex symmetry (Q1957352) (← links)
- On the isomorphism problem for some classes of computable algebraic structures (Q2155501) (← links)
- Cohesive powers of linear orders (Q2179360) (← links)
- On decidable categoricity and almost prime models (Q2203434) (← links)
- Turing degrees and automorphism groups of substructure lattices (Q2213916) (← links)
- Turing degrees of complete formulas of almost prime models (Q2300743) (← links)
- Computability-theoretic properties of injection structures (Q2342300) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Describing free groups (Q2844726) (← links)
- The Lattice of Computably Enumerable Vector Spaces (Q2970969) (← links)
- (Q3068266) (← links)
- Computability of Fraïssé limits (Q3083128) (← links)
- Effective Categoricity of Injection Structures (Q3091440) (← links)
- (Q3179080) (← links)
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra (Q3188263) (← links)
- Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
- Bounding homogenous models (Q3426576) (← links)
- Spectra of structures and relations (Q3426577) (← links)
- COMPACTNESS OF THE SPACE OF LEFT ORDERS (Q3439895) (← links)
- Index sets of computable structures (Q3546058) (← links)
- $\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures (Q3576042) (← links)
- REGULAR RELATIONS AND THE QUANTIFIER “THERE EXIST UNCOUNTABLY MANY” (Q3669391) (← links)
- (Q3949430) (← links)
- (Q3955415) (← links)
- (Q4249356) (← links)
- (Q4420753) (← links)
- Trivial, strongly minimal theories are model complete after naming constants (Q4425430) (← links)
- Computability-Theoretic Complexity of Countable Structures (Q4432545) (← links)
- Orders on magmas and computability theory (Q4579847) (← links)
- Sequences of <i>n</i>-diagrams (Q4779662) (← links)