Valentina S. Harizanov

Orcid: 0000-0002-6626-5074

According to our database1, Valentina S. Harizanov authored at least 50 papers between 1983 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cohesive powers of structures.
Arch. Math. Log., July, 2024

In Memory of Martin Davis.
CoRR, 2024

2023
On Cohesive powers of linear Orders.
J. Symb. Log., 2023

Generically Computable Abelian Groups.
Proceedings of the Unconventional Computation and Natural Computation, 2023

2022
Densely computable structures.
J. Log. Comput., 2022

Interpreting a field in its Heisenberg Group.
J. Symb. Log., 2022

Generically and coarsely computable isomorphisms.
Comput., 2022

On the isomorphism problem for some classes of computable algebraic structures.
Arch. Math. Log., 2022

2019
Computability-theoretic categoricity and Scott families.
Ann. Pure Appl. Log., 2019

2018
Strong jump inversion.
J. Log. Comput., 2018

2017
The Lattice of Computably Enumerable Vector Spaces.
Proceedings of the Computability and Complexity, 2017

2016
Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2014
Turing Degrees of Isomorphism Types of Geometric Objects.
Comput., 2014

Isomorphisms of Non-Standard Fields and Ash's Conjecture.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

Computable model theory.
Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2013
Two-to-one structures.
J. Log. Comput., 2013

2012
Spectra of high<i><sub>n</sub></i> and non-low<i><sub>n</sub></i> degrees.
J. Log. Comput., 2012

Isomorphism relations on computable structures.
J. Symb. Log., 2012

2011
Computability of Fraïssé limits.
J. Symb. Log., 2011

Σ<sup>0</sup><sub>1</sub> and Π<sup>0</sup><sub>1</sub> equivalence structures.
Ann. Pure Appl. Log., 2011

Effective Categoricity of Injection Structures.
Proceedings of the Models of Computation in Context, 2011

2010
Spaces of orders and their Turing degree spectra.
Ann. Pure Appl. Log., 2010

2009
Intrinsic bounds on complexity and definability at limit levels.
J. Symb. Log., 2009

Effective categoricity of Abelian p-groups.
Ann. Pure Appl. Log., 2009

Chains and antichains in partial orderings.
Arch. Math. Log., 2009

Degree spectra of the successor relation of computable linear orderings.
Arch. Math. Log., 2009

Preface.
Arch. Math. Log., 2009

S<sup>0</sup><sub>1</sub> and P<sup>0</sup><sub>1</sub> Equivalence Structures.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Partial automorphism semigroups.
Ann. Pure Appl. Log., 2008

2007
Introduction to the Philosophy and Mathematics of Algorithmic Learning Theory.
Proceedings of the Induction, Algorithmic Learning Theory, and Philosophy, 2007

Inductive Inference Systems for Learning Classes of Algorithmically Generated Sets and Structures.
Proceedings of the Induction, Algorithmic Learning Theory, and Philosophy, 2007

Spectra of structures and relations.
J. Symb. Log., 2007

Bounding homogeneous models.
J. Symb. Log., 2007

Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations.
J. Symb. Log., 2007

On the learnability of vector spaces.
J. Comput. Syst. Sci., 2007

2006
Effective categoricity of equivalence structures.
Ann. Pure Appl. Log., 2006

2005
Enumerations in computable structure theory.
Ann. Pure Appl. Log., 2005

Dependence relations in computably rigid computable vector spaces.
Ann. Pure Appl. Log., 2005

2004
Pi<sub>1</sub><sup>1</sup> relations and paths through.
J. Symb. Log., 2004

2003
Turing degrees of hypersimple relations on computable structures.
Ann. Pure Appl. Log., 2003

Simple and immune relations on countable structures.
Arch. Math. Log., 2003

2002
Sequences of n-Diagrams.
J. Symb. Log., 2002

Computability-theoretic complexity of countable structures.
Bull. Symb. Log., 2002

1998
Turing Degrees of Certain Isomorphic Images of Computable Relations.
Ann. Pure Appl. Log., 1998

1996
Effectively and Noneffectively Nowhere Simple Sets.
Math. Log. Q., 1996

1993
The Possible Turing Degree of the Nonzero Member in a Two Element Degree Spectrum.
Ann. Pure Appl. Log., 1993

1992
Frequency Computations and the Cardinality Theorem.
J. Symb. Log., 1992

1991
Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra.
Ann. Pure Appl. Log., 1991

Uncountable Degree Spectra.
Ann. Pure Appl. Log., 1991

1983
Regular Relations and the Quantifier "There Exist uncountably Many".
Math. Log. Q., 1983


  Loading...