Valentina Harizanov

Valentina Harizanov's AcademicInfluence.com Rankings

Valentina Harizanov

Mathematics

#4081

World Rank

#5875

Historical Rank

#1446

USA Rank

Measure Theory

#3992

World Rank

#4704

Historical Rank

#1137

USA Rank

mathematics Degrees

Download Badge

Mathematics

Valentina Harizanov's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is Valentina Harizanov Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Valentina Harizanov is a Serbian-American mathematician and professor of mathematics at The George Washington University. Her main research contributions are in computable structure theory , where she introduced the notion of degree spectra of relations on computable structures and obtained the first significant results concerning uncountable, countable, and finite Turing degree spectra. Her recent interests include algorithmic learning theory and spaces of orderss on groupss.

(See a Problem?)

Valentina Harizanov's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Algebraic number fields (2006) (243)
Enumerations in computable structure theory (2005) (100)
Effective categoricity of equivalence structures (2006) (75)
Pure computable model theory (1998) (71)
Isomorphism relations on computable structures (2012) (60)
Journal of Knot Theory and its Ramifications: Introduction (2011) (51)
Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra (1991) (49)
Formal Approaches to Modality (2005) (46)
Frequency computations and the cardinality theorem (1992) (42)
Index sets of computable structures (2006) (41)
Intrinsic bounds on complexity and definability at limit levels (2009) (32)
The Possible Turing Degree of the Nonzero Member in a Two Element Degree Spectrum (1993) (30)
Turing Degrees of Certain Isomorphic Images of Computable Relations (1998) (28)
Describing free groups (2012) (28)
Uncountable Degree Spectra (1991) (28)
Spectra of structures and relations (2007) (25)
Trivial, Strongly Minimal Theories Are Model Complete After Naming Constants (2003) (24)
Spectra of highn and non-lown degrees (2012) (24)
Chapter 1 Pure computable model theory (1998) (23)
1 1 relations and paths through O (2004) (22)
Π11 relations and paths through (2004) (21)
Computable model theory (2014) (21)
Effective categoricity of Abelian p-groups (2008) (20)
Compactness of the space of left orders (2006) (20)
Turing degrees of isomorphism types of algebraic objects (2005) (17)
Computability-Theoretic Properties of Injection Structures (2014) (17)
Computability of Fraïssé limits (2011) (17)
Computable Structures and the Hyperarithmetical Hierarchy . Studies in Logic and the Foundations of Mathematics (2001) (16)
Degree spectra of the successor relation of computable linear orderings (2009) (15)
Logic and algebraic structures in quantum computing (2016) (15)
Π10 classes and strong degree spectra of relations (2007) (14)
Induction, Algorithmic Learning Theory, and Philosophy (2007) (14)
Computability-theoretic complexity of countable structures (2002) (13)
On the learnability of vector spaces (2002) (10)
On Automorphic Tuples of Elements in Computable Models (2005) (9)
Σ01 and Π01 equivalence structures (2011) (8)
Spaces of orders and their Turing degree spectra (2010) (8)
Simple structures with complex symmetry (2010) (7)
Index Sets for n-Decidable Structures Categorical Relative to m-Decidable Presentations (2015) (7)
Isomorphism and Bi-Embeddability Relations on Computable Structures ∗ (2010) (7)
The computable embedding problem (2012) (6)
Chains and antichains in partial orderings (2009) (6)
Turing degree spectra of groups and their spaces of orders (2006) (6)
Isomorphisms of Non-Standard Fields and Ash's Conjecture (2014) (6)
Dependence relations in computably rigid computable vector spaces (2005) (6)
Simple and immune relations on countable structures (2003) (6)
EFFECTIVELY NOWHERE SIMPLE RELATIONS ON COMPUTABLE STRUCTURES (2001) (6)
Effective Categoricity of Injection Structures (2011) (6)
Sequences of n-diagrams (2002) (6)
Could logic be empirical? The Putnam-Kripke debate (2016) (5)
Computability-theoretic categoricity and Scott families (2019) (5)
Orbits of Maximal Vector Spaces (2016) (5)
Bounding homogenous models (2007) (5)
Relations on computable structures (2001) (4)
Partial automorphism semigroups (2008) (4)
Turing degrees of nonabelian groups (2007) (4)
Turing Degrees of Complete Formulas of Almost Prime Models (2019) (3)
Regular Relations and the Quantifier "There Exist uncountably Many" (1983) (3)
Turing degrees of hypersimple relations on computable structures (2003) (3)
Two-to-one structures (2013) (3)
Review of Yuri V. Matiyasevich, Hibert's Tenth Problem (1995) (3)
Introduction to the Philosophy and Mathematics of Algorithmic Learning Theory (2007) (3)
Densely computable structures (2021) (3)
Effectively and Noneffectively Nowhere Simple Sets (1996) (3)
Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra (2016) (3)
Strong jump inversion (2018) (3)
Computability and Definability (2020) (3)
On Decidable Categoricity and Almost Prime Models (2020) (2)
Orders on magmas and computability theory (2018) (2)
Relatively Hyperimmune Relations on Structures (2004) (2)
Cohesive Powers of Linear Orders (2019) (2)
Turing Degrees of Isomorphism Types of Geometric Objects (2011) (1)
Turing Degrees and Automorphism Groups of Substructure Lattices (2020) (1)
Inductive Inference Systems for Learning Classes of Algorithmically Generated Sets and Structures (2007) (1)
Carnegie Mellon University, Pittsburgh, PA May 19–23, 2004 (2005) (1)
Turing Degrees and Automorphism Groups of Substructure Lattices (2018) (1)
GROUPS WITH ORDERINGS OF ARBITRARY ALGORITHMIC COMPLEXITY (2017) (1)
Π₁¹ Relations and Paths through ᵊ (2004) (1)
S01 and P01 Equivalence Structures (2009) (1)
INTERPRETING A FIELD IN ITS HEISENBERG GROUP (2020) (1)
The Lattice of Computably Enumerable Vector Spaces (2017) (1)
And equivalence structures (2011) (1)
A (very) brief tour of quantum mechanics, computation, and category theory (2016) (0)
On the computable isomorphism problem for some algebraic structures∗ (2021) (0)
Preface (1922) (0)
Goncharov Sergei S.. Countable Boolean algebras and decidability . English translation of Schetnye bulevy algebry i razreshimost′. Siberian school of algebra and logic. Consultants Bureau, New York, London, and Moscow, 1997, xii + 318 pp. (1998) (0)
2005–06 Winter Meeting of the Association for Symbolic Logic (2006) (0)
GENERICALLY COMPUTABLE STRUCTURES (2020) (0)
Generically and coarsely computable isomorphisms (2022) (0)
Structures and partial computable automorphisms (2006) (0)
The computable embedding problem (2012) (0)
New Orleans Marriott and Sheraton New Orleans New Orleans, Louisiana January 7–8, 2007 (2007) (0)
Effective Categoricity of Equivalence Structures FINAL DRAFT (2008) (0)
Review: C. J. Ash, J. Knight, Computable Structures and the Hyperarithmetical Hierarchy (2001) (0)
Computability and Denability (2019) (0)
Index Sets for n-Decidable Structures Categorical Relative to m-Decidable Presentations (2015) (0)
San Antonio Convention Center San Antonio, Texas January 14–15, 2006 (2006) (0)
Handbook of Recursive Mathematics , vol . 1 Chapter 1 : Pure Computable Model Theory (2006) (0)
Computability-Theoretic Properties of Injection Structures (2014) (0)
Belegradek, O., Verbovskiy, V. and Wagner, FO, Coset (2003) (0)
Downey, R., Fiiredi, Z., Jockusch Jr., CG and Ruhel, LA (1998) (0)
Orbits of Maximal Vector Spaces (2016) (0)
Turing Degrees of Complete Formulas of Almost Prime Models (2019) (0)
Logic Seminar Fall 2010 Title: Algebraic Fields and Computable Categoricity (2010) (0)
Ordered Structures and Computability Ordered Structures and Computability Dedication (2009) (0)
Cohesive Powers of Structures (2023) (0)
On Decidable Categoricity and Almost Prime Models (2020) (0)
Pi11 relations and paths through (2004) (0)
S 0 1 and P 0 1 Equivalence Structures. (2009) (0)
On the isomorphism problem for some classes of computable algebraic structures (2022) (0)
Generically Computable Equivalence Structures and Isomorphisms (2018) (0)
Sessions of the Seminar “Algebra i Logika” (2016) (0)

This paper list is powered by the following services:

Other Resources About Valentina Harizanov

en.wikipedia.org

What Schools Are Affiliated With Valentina Harizanov?

Valentina Harizanov is affiliated with the following schools:

Valentina Harizanov's Academic­Influence.com Rankings