default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentina S. Harizanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Valentina S. Harizanov, Keshav Srinivasan:
Cohesive powers of structures. Arch. Math. Log. 63(5-6): 679-702 (2024)- [i1]Wesley Calvert, Valentina S. Harizanov, Eugenio G. Omodeo, Alberto Policriti
, Alexandra Shlapentokh:
In Memory of Martin Davis. CoRR abs/2401.10154 (2024) - 2023
- [j39]Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov, Paul Shafer, Alexandra A. Soskova, Stefan V. Vatev:
On Cohesive powers of linear Orders. J. Symb. Log. 88(3): 947-1004 (2023) - [c8]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Generically Computable Abelian Groups. UCNC 2023: 32-45 - 2022
- [j38]Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon:
On the isomorphism problem for some classes of computable algebraic structures. Arch. Math. Log. 61(5-6): 813-825 (2022) - [j37]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Generically and coarsely computable isomorphisms. Comput. 11(3-4): 223-239 (2022) - [j36]Rachael Alvir, Wesley Calvert, Grant Goodman, Valentina S. Harizanov, Julia F. Knight, Russell G. Miller, Andrey S. Morozov, Alexandra A. Soskova, Rose Weisshaar:
Interpreting a field in its Heisenberg Group. J. Symb. Log. 87(3): 1215-1230 (2022) - [j35]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Densely computable structures. J. Log. Comput. 32(3): 581-607 (2022)
2010 – 2019
- 2019
- [j34]Ekaterina B. Fokina, Valentina S. Harizanov, Daniel Turetsky:
Computability-theoretic categoricity and Scott families. Ann. Pure Appl. Log. 170(6): 699-717 (2019) - [c7]Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov, Paul Shafer, Alexandra A. Soskova, Stefan V. Vatev:
Cohesive Powers of Linear Orders. CiE 2019: 168-180 - 2018
- [j33]Wesley Calvert, Andrey N. Frolov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Alexandra A. Soskova, Stefan V. Vatev:
Strong jump inversion. J. Log. Comput. 28(7): 1499-1522 (2018) - 2017
- [c6]Rumen D. Dimitrov, Valentina S. Harizanov:
The Lattice of Computably Enumerable Vector Spaces. Computability and Complexity 2017: 366-393 - 2016
- [c5]Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov:
Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra. CiE 2016: 251-260 - 2014
- [j32]Wesley Calvert, Valentina S. Harizanov, Alexandra Shlapentokh:
Turing Degrees of Isomorphism Types of Geometric Objects. Comput. 3(2): 105-134 (2014) - [c4]Rumen D. Dimitrov, Valentina S. Harizanov, Russell G. Miller, K. J. Mourad:
Isomorphisms of Non-Standard Fields and Ash's Conjecture. CiE 2014: 143-152 - [p3]Ekaterina B. Fokina, Valentina S. Harizanov, Alexander G. Melnikov:
Computable model theory. Turing's Legacy 2014: 124-194 - 2013
- [j31]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Two-to-one structures. J. Log. Comput. 23(6): 1195-1223 (2013) - 2012
- [j30]Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán:
Isomorphism relations on computable structures. J. Symb. Log. 77(1): 122-132 (2012) - [j29]Andrey N. Frolov, Iskander Sh. Kalimullin, Valentina S. Harizanov, Oleg V. Kudinov, Russell G. Miller:
Spectra of highn and non-lown degrees. J. Log. Comput. 22(4): 755-777 (2012) - 2011
- [j28]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Σ01 and Π01 equivalence structures. Ann. Pure Appl. Log. 162(7): 490-503 (2011) - [j27]Barbara F. Csima, Valentina S. Harizanov, Russell G. Miller, Antonio Montalbán:
Computability of Fraïssé limits. J. Symb. Log. 76(1): 66-93 (2011) - [c3]Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Effective Categoricity of Injection Structures. CiE 2011: 51-60 - 2010
- [j26]Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, Valentina S. Harizanov, Amir A. Togha:
Spaces of orders and their Turing degree spectra. Ann. Pure Appl. Log. 161(9): 1134-1143 (2010)
2000 – 2009
- 2009
- [j25]Douglas A. Cenzer, Valentina S. Harizanov, David Marker, Carol Wood:
Preface. Arch. Math. Log. 48(1): 1-6 (2009) - [j24]Jennifer Chubb, Andrey N. Frolov, Valentina S. Harizanov:
Degree spectra of the successor relation of computable linear orderings. Arch. Math. Log. 48(1): 7-13 (2009) - [j23]Valentina S. Harizanov, Carl G. Jockusch Jr., Julia F. Knight:
Chains and antichains in partial orderings. Arch. Math. Log. 48(1): 39-53 (2009) - [j22]Wesley Calvert, Douglas A. Cenzer, Valentina S. Harizanov, Andrei S. Morozov:
Effective categoricity of Abelian p-groups. Ann. Pure Appl. Log. 159(1-2): 187-197 (2009) - [j21]John Chisholm, Ekaterina B. Fokina, Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Sara Quinn:
Intrinsic bounds on complexity and definability at limit levels. J. Symb. Log. 74(3): 1047-1060 (2009) - [c2]Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
S01 and P01 Equivalence Structures. CiE 2009: 99-108 - 2008
- [j20]Jennifer Chubb, Valentina S. Harizanov, Andrei S. Morozov, Sarah Pingrey, Eric Ufferman:
Partial automorphism semigroups. Ann. Pure Appl. Log. 156(2-3): 245-258 (2008) - 2007
- [j19]Valentina S. Harizanov, Frank Stephan:
On the learnability of vector spaces. J. Comput. Syst. Sci. 73(1): 109-122 (2007) - [j18]Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare:
Bounding homogeneous models. J. Symb. Log. 72(1): 305-323 (2007) - [j17]Valentina S. Harizanov, Russell G. Miller:
Spectra of structures and relations. J. Symb. Log. 72(1): 324-348 (2007) - [j16]John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey:
Π10 classes and strong degree spectra of relations. J. Symb. Log. 72(3): 1003-1018 (2007) - [p2]Valentina S. Harizanov, Norma B. Goethe, Michèle Friend:
Introduction to the Philosophy and Mathematics of Algorithmic Learning Theory. Induction, Algorithmic Learning Theory, and Philosophy 2007: 1-24 - [p1]Valentina S. Harizanov:
Inductive Inference Systems for Learning Classes of Algorithmically Generated Sets and Structures. Induction, Algorithmic Learning Theory, and Philosophy 2007: 27-54 - [e1]Michèle Friend, Norma B. Goethe, Valentina S. Harizanov:
Induction, Algorithmic Learning Theory, and Philosophy. Logic, Epistemology, and the Unity of Science 9, Springer 2007, ISBN 978-1-4020-6126-4 [contents] - 2006
- [j15]Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov:
Effective categoricity of equivalence structures. Ann. Pure Appl. Log. 141(1-2): 61-78 (2006) - 2005
- [j14]Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov:
Dependence relations in computably rigid computable vector spaces. Ann. Pure Appl. Log. 132(1): 97-108 (2005) - [j13]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell G. Miller, Reed Solomon:
Enumerations in computable structure theory. Ann. Pure Appl. Log. 136(3): 219-246 (2005) - 2004
- [j12]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Richard A. Shore:
Pi11 relations and paths through. J. Symb. Log. 69(2): 585-611 (2004) - 2003
- [j11]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy:
Simple and immune relations on countable structures. Arch. Math. Log. 42(3): 279-291 (2003) - [j10]Valentina S. Harizanov:
Turing degrees of hypersimple relations on computable structures. Ann. Pure Appl. Log. 121(2-3): 209-226 (2003) - 2002
- [j9]Valentina S. Harizanov:
Computability-theoretic complexity of countable structures. Bull. Symb. Log. 8(3): 457-477 (2002) - [j8]Valentina S. Harizanov, Julia F. Knight, Andrei S. Morozov:
Sequences of n-Diagrams. J. Symb. Log. 67(3): 1227-1247 (2002) - [c1]Valentina S. Harizanov, Frank Stephan:
On the Learnability of Vector Spaces. ALT 2002: 233-247
1990 – 1999
- 1998
- [j7]Valentina S. Harizanov:
Turing Degrees of Certain Isomorphic Images of Computable Relations. Ann. Pure Appl. Log. 93(1-3): 103-113 (1998) - 1996
- [j6]Valentina S. Harizanov:
Effectively and Noneffectively Nowhere Simple Sets. Math. Log. Q. 42: 241-248 (1996) - 1993
- [j5]Valentina S. Harizanov:
The Possible Turing Degree of the Nonzero Member in a Two Element Degree Spectrum. Ann. Pure Appl. Log. 60(1): 1-30 (1993) - 1992
- [j4]Valentina S. Harizanov, Martin Kummer, James C. Owings:
Frequency Computations and the Cardinality Theorem. J. Symb. Log. 57(2): 682-687 (1992) - 1991
- [j3]Valentina S. Harizanov:
Uncountable Degree Spectra. Ann. Pure Appl. Log. 54(3): 255-263 (1991) - [j2]Valentina S. Harizanov:
Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra. Ann. Pure Appl. Log. 55(1): 51-65 (1991)
1980 – 1989
- 1983
- [j1]Zarko Mijajlovic, Valentina S. Harizanov:
Regular Relations and the Quantifier "There Exist uncountably Many". Math. Log. Q. 29(3): 151-161 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
