Valentina Harizanov

Bibliography

Books

• Induction, Algorithmic Learning Theory, and Philosophy, co-edited with M. Friend and N.B. Goethe, Series Logic, Epistemology, and the Unity of Science, vol. 9, Springer, 304 pp., 2007. ISBN: 978-1-4020-6126-4.  Editors' preface
• Archive for Mathematical Logic Special Issue: The Workshop on Model Theory and Computable Model Theory, 2007, co-edited with D. Cenzer, D. Marker and C. Wood, Springer, Berlin, 140 pp., February 2009.
• Computable Model Theory, research monograph and graduate textbook, under contract with Cambridge University Press (Perspectives in Logic Series), in preparation, approx. 350 pages.

Research Papers in Refereed Journals and Volumes

• Simple structures with complex symmetry,” co-authored with R. Miller and A. Morozov, submitted.
• Describing free groups, co-authored with J. Carson, J. Knight, K. Lange, C. McCoy, C. Maher, C. McCoy, A. Moroov, S. Quinn and J. Wallbaum, submitted.
• Computable embedding problems, co-authored with J. Carson, E. Fokina, J. Knight, C. Maher, S. Quinn and J. Wallbaum, submitted.
• Computability of Fraïssé limits co-authored with B. Csima, R. Miller, and  A. Montalbán, submitted.
• Spaces of orders and their Turing degree spectra, co-authored with M. Dabkowska, M. Dabkowski, and A. Togha, to appear in the Annals of Pure and Applied Logic.
• S⁰ 1 and P⁰ 1 equivalence structures, co-authored with D. Cenzer and J. Remmel, Mathematical Theory and Computattional Practice, Lecture Notes of Computer Science 5635 (2009), pp.1047–1060.
• Intrinsic bounds on complexity at limit levels, co-authored with J. Chisholm, E. Fokina, S. Goncharov, J. Knight, S. Miller, Journal of Symbolic Logic 74 (2009), pp.1047–1060.
• Effective categoricity of Abelian p-groups, co-authored with W. Calvert, D. Cenzer, and A. Morozov, Annals of Pure and Applied Logic 159 (2009), pp.187–197.
• Degree spectra of the successor relation of computable linear orderings, co-authored with  J. Chubb and A. Frolov, Archive for Mathematical Logic 48 (2009), pp. 7–13.
• Chains and antichains in computable partial orderings, co-authored with C. Jockusch and J. Knight, Archive for Mathematical Logic 48 (2009), pp.39–53.
• Partial automorphism semigroups, co-authored with J. Chubb, A. Morozov, S. Pingrey, and E. Ufferman, Annals of Pure and Applied Logic 156 (2008), pp. 245–258.
• P⁰1 classes and strong degree spectra of relations, co-authored with J. Chisholm, J.Chubb, D. Hirschfeldt, C. Jockusch, T. McNicholl, and S. Pingrey, to appear in the Journal of Symbolic Logic 72 (2007), pp. 1003–1018.
• Turing degrees of nonabelian groups, co-authored with M. Dabkowska, M. Dabkowski, and A. Sikora, Proceedings of the American Mathematical Society, 135 (2007), pp. 3383–3391.
• Turing degrees of the isomorphism types of algebraic objects, co-authored with W. Calvert and A. Shlapentokh, Journal of the London Mathematical Society 73 (2007), pp. 273–286.
• Compactness and spaces of left orders, co-authored with M. Dabkowska, M. Dabkowski, J. Przytycki, and M. Veve, Journal of Knot Theory  and Its Ramifications 16 (2007), pp. 257–266.
• Spectra of structures and relations, co-authored with R. Miller, Journal of Symbolic Logic 72 (2007), pp.324–348.
• On the learnability of vector spaces, co-authored with F. Stephan, Journal of Computer and System Sciences 73 (2007), pp. 109–122. (Preliminary conference version in: Algorithmic Learning Theory, N. Cesa-Bianchi, M. Numao, and R. Reischuk (editors), Springer-Verlag, Berlin, 2002, pp. 233–247.)
• Bounding homogeneous models, co-authored with B. Csima, D. Hirschfeldt, and R. Soare, Journal of Symbolic Logic 72 (2007), pp.305–323.
• Inductive inference systems for learning classes of algorithmically generated sets and structures, Induction, Algorithmic Learning Theory, and Philosophy (Springer, Dordrecht, 2007), pp. 27–54.
• Introduction to the philosophy and mathematics of algorithmic learning theory, Induction, Algorithmic Learning Theory, and Philosophy (Springer, Dordrecht, 2007), pp. 1–24.
• Index sets of computable structures, co-authored with W. Calvert, J. Knight, and S. Miller, Algebra and Logic 45 (2006), pp.306–325.
• Formal approaches to modality, co-authored with S. Kaufmann and C. Condoravdi, The Expression of Modality, W. Frawley (editor), Mouton de Gruyter, Berlin, 2006, pp. 71–106. Editor's Preface
• Effective categoricity of equivalence structures, co-authored with W. Calvert, D. Cenzer, and A. Morozov, Annals of Pure and Applied Logic 141 (2006), pp. 61–78.
• Enumerations in computable structure theory, co-authored with S. Goncharov, J. Knight, C. McCoy, R. Miller, and R. Solomon, Annals of Pure and Applied Logic 136 (2005), pp. 219–246.
• On automorphic tuples of elements in computable models,” Russian translation, co-authored with S. Goncharov, J. Knight, A. Morozov, and A. Romina,  Siberian Mathematical Journal 46, 2005, pp. 523–532 (Russian); pp. 405–412 (English translation).
• Dependence relations in computably rigid computable vector spaces, co-authored with R. Dimitrov, and A. Morozov, Annals of Pure and Applied Logic 132, 2005, pp.97–108.
• P¹₁ relations and paths through O, co-authored with S. Goncharov, J. Knight, and R. Shore, Journal of Symbolic Logic 69, 2004, pp.585–611.
• Relatively hyperimmune relations on structures, co-authored with S. Goncharov, J. Knight, and C. McCoy, Algebra and Logic 43, 2004, pp.94–101.
• Trivial, strongly minimal theories are model complete after naming constants, co-authored with S. Goncharov, M. Laskowski, S. Lempp, and C. McCoy, Proceedings of the American Mathematical Society 131, 2003, pp. 3901–3912.
• Turing degrees of hypersimple relations on computable structures, Annals of Pure and Applied Logic 121, 2003, pp. 209–226.
• Simple and immune relations on countable structures, co-authored with S. Goncharov, J. Knight, and C. McCoy, Archive for Mathematical Logic 42, 2003, pp.279–291.
• Computably-theoretic complexity of countable structures, Bulletin of Symbolic Logic 8, 2002, pp. 457–477.
• Sequences of n-diagrams, co-authored with J Knight and A. Morozov, Journal of Symbolic Logic 67, 2002, pp.1227–1247.
• Relations on computable structures, Contemporary Mathematics, N. Bokan (editor), devoted to the 125^th anniversary of the Department of Mathematics, University of Belgrade, 2000, pp. 65–81.
• Effectively nowhere simple relations on computable structures, Recursion Theory and Complexity, vol. 2, M. Arslanov, and S. Lempp (editors), de Gruyter, Berlin, 1999, pp. 59–70.
• Pure Computable Model Theory, Handbook of Recursive Mathematics, vol. I, Yu. Ershov, S. Goncharov, A. Nerode, and J. B. Remmel (editors), North-Holland, Amsterdam, 1998, pp. 3–114.
• Turing degrees of certain isomorphic images of recursive relations, Annals of Pure and Applied Logic 93, 1998, pp. 103–113.
• Effectively and non-effectively nowhere simple sets, Mathematical Logic Quarterly 42, 1996, pp. 241–248.
• The possible Turing degree of the nonzero member in a two-element degree spectrum, Annals of Pure and Applied Logic 60, 1993, pp. 1–30.
• Frequency computations and the cardinality theorem, pdf file from JSTOR, co-authored with M. Kummer, and J. Owings, Journal of Symbolic Logic 57, 1992, pp. 682–687.
• Some effects of Ash-Nerode and other decidability conditions on degree spectra, Annals of Pure and Applied Logic 55, 1991, pp. 51–65.
• Uncountable degree spectra, Annals of Pure and Applied Logic 54, 1991, pp. 255–263.
• Regular relations and the quantifier ‘there exists uncountably many’, co-authored with Z. Mijajlovic, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 29, 1983, pp. 151–161.
• On some finite groupoids whose equational theories are not finitely based, Algebraic Conference, Mathematical Institute, Novi Sad, 1982, pp. 35–38.
•  On the functional equation ƒfƒ=ƒ, Publications de l’Institut Mathématique, Nouvelle Série 29, 1981, pp. 61–64.

Invited Book Reviews

• Computable Structures and Hyperarithmetical Hierarchy by C.J. Ash and J. Knight, V. Harizanov, Bulletin of Symbolic Logic 3, 2001, pp. 383–385.
• Countable Boolean Algebras and Decidability by S. Goncharov, V. Harizanov, Journal of Symbolic Logic 63, 1998, pp. 1188–1190.
• V. Matiyasevich, Hilbert’s Tenth Problem, V. Harizanov,Modern Logic (International Journal for the History of Mathematical Logic, Set Theory, and Foundations of Mathematics) 5, 1995, pp. 345–355.
• Douglas Hofstadter (a review of Gödel, Escher, Bach), V. Harizanov GW Forum, Spring, 1988, pp. 46–48.

Translations

• M. V. Zakhar’yashchev, Modal companions of superintuitionistic logics: syntax, semantics, and preservation theorems, Mathematics of the USSR Sbornik 68 (1991), pp. 277–289. Translated from Russian by V. Harizanov.
• A. I. Tsitkin, Towards the question of an error in a well-known paper by M. Wajsberg, Selecta Mathematica Sovietica 7, 1988, pp. 23–36. Translated from Russian by V. Harizanov.
• V. P. Orevkov, Theorems with very short proofs can be strengthened, Selecta Mathematica Sovietica 7, 1988, pp. 37–38. Translated from Russian by V. Harizanov.
• I. D. Zaslavsky, The realization of three-valued logical functions through recursive and Turing operators, Selecta Mathematica Sovietica 7, 1988, pp. 15–22. Translated from Russian by V. Harizanov.
• K. Zh. Kudaibergenov, On questions of Keisler and Morley, Soviet Mathematics Doklady (Russian Academy of Sciences) 34, 1987, pp. 482–483. Translated from Russian by V. Harizanov.
• N. V. Petri, Unsolvability of the recognition problem for annihilating iterative networks, Selecta Mathematica Sovietica 6, 1987, pp. 355–363. Translated from Russian by V. Harizanov.
• N. K. Zamov, The resolution method without skolemization, Soviet Mathematics Doklady (Russian Academy of Sciences) 35, 1987, pp. 399–401. Translated from Russian by V. Harizanov.
• D. P. Skvortsov, Some propositional logics connected with Yu. T. Medvedev’s concept of types of information, Selecta Mathematica Sovietica 5, 1986, pp. 371–377. Translated from Russian by V. Harizanov.
• L. L. Esakia, On the variety of Grzegorczyk algebras, Selecta Mathematica Sovietica 3, 1983/84, pp. 343–366. Translated from Russian by V. Harizanov.