Search the dblp DataBase

Publications of Author

1. Valentina S. Harizanov, Frank Stephan
   On the Learnability of Vector Spaces. [Citation Graph (0, 0)][DBLP]
   ALT, 2002, pp:233-247 [Conf]
   
2. Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy
   Simple and immune relations on countable structures. [Citation Graph (0, 0)][DBLP]
   Arch. Math. Log., 2003, v:42, n:3, pp:279-291 [Journal]
   
3. Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov
   Dependence relations in computably rigid computable vector spaces. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2005, v:132, n:1, pp:97-108 [Journal]
   
4. Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell Miller, Reed Solomon
   Enumerations in computable structure theory. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2005, v:136, n:3, pp:219-246 [Journal]
   
5. Valentina S. Harizanov
   Turing degrees of hypersimple relations on computable structures. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2003, v:121, n:2-3, pp:209-226 [Journal]
   
6. Valentina S. Harizanov
   Uncountable Degree Spectra. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1991, v:54, n:3, pp:255-263 [Journal]
   
7. Valentina S. Harizanov
   Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1991, v:55, n:1, pp:51-65 [Journal]
   
8. Valentina S. Harizanov
   The Possible Turing Degree of the Nonzero Member in a Two Element Degree Spectrum. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1993, v:60, n:1, pp:1-30 [Journal]
   
9. Valentina S. Harizanov
   Turing Degrees of Certain Isomorphic Images of Computable Relations. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:103-113 [Journal]
   
10. Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov
    Effective categoricity of equivalence structures. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:1-2, pp:61-78 [Journal]
    
11. Valentina S. Harizanov
    Computability-theoretic complexity of countable structures. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2002, v:8, n:3, pp:457-477 [Journal]
    
12. Valentina S. Harizanov, Frank Stephan
    On the learnability of vector spaces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:1, pp:109-122 [Journal]
    
13. Valentina S. Harizanov, Julia F. Knight, Andrei S. Morozov
    Sequences of n-Diagrams. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:3, pp:1227-1247 [Journal]
    
14. Valentina S. Harizanov, Martin Kummer, James C. Owings
    Frequency Computations and the Cardinality Theorem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:2, pp:682-687 [Journal]
    
15. Valentina S. Harizanov
    Effectively and Noneffectively Nowhere Simple Sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:241-248 [Journal]
    
16. 
    S⁰₁ and P⁰₁ Equivalence Structures. [Citation Graph (, )][DBLP]
    
    
17. 
    Degree spectra of the successor relation of computable linear orderings. [Citation Graph (, )][DBLP]
    
    
18. 
    Preface. [Citation Graph (, )][DBLP]
    
    
19. 
    Chains and antichains in partial orderings. [Citation Graph (, )][DBLP]
    
    
20. 
    Partial automorphism semigroups. [Citation Graph (, )][DBLP]
    
    
21. 
    Effective categoricity of Abelian p-groups. [Citation Graph (, )][DBLP]