Research Interests
Universal Algebra, General Algebra, Finite Model Theory, Logic and Foundations, Tame Congruence Theory, Constraint Satisfaction, Mathematical Education
Publications
J. Horowitz, Testing for Edge Terms are Decidable, Algebra Universalis, Vol. 73, Iss. 3 (2015), 321-334, DOI 10.1007/s00012-015-0325-4 [DOI][PDF] (The final publication is available at link.springer.com)
J. Horowitz, Computational Complexity of Various Mal'cev Conditions, International Journal of Algebra and Computation, Vol. 23, No. 6 2013, 1521-1531 [DOI][PDF]
Conference Presentations
May 2015 - Determining congruence n-permutability is hard (n at least 3?) at Open Problems in Universal Algebra, Nashville, TN, USA
May 2014 - Some Hardness Results for Mal'cev Conditions at ASL 2014 North American Annual Meeting, Boulder, CO, USA
October 2013 - A Syntactic Approach to Linear Idempotent Mal'cev Conditions at AMS Fall Southeastern Sectional Meeting, Special Session on Finite Universal Algebra, Louisville, KY, USA
July 2013 - A Syntactic Approach to Linear Idempotent Mal'cev Conditions at Workshop on General Algebra and its Applications, Melbourne, Australia [Slides]
Thesis
J. Horowitz, Results on the Computational Complexity of Linear Idempotent Mal'cev Conditions, PhD Thesis, McMaster University, 2011 [Link]