Pavel Semukhin

PIMS Postdoctoral Researcher
Department of Computer Science
University of Regina
Canada

Research interests:  automatic structures, computable model theory, learning theory.


PhD Thesis:
    Topics in Computable Model Theory, The University of Auckland, 2008.
    PostScript –  PDF (with hyperlinks)
    PostScript –  PDF (without hyperlinks)



List of Publications:

1. S. Jain, Q. Luo, P. Semukhin, F. Stephan, Uncountable automatic classes and learning, Theoretical Computer Science, 412 (2011), No 19, 1805–1820.
    PostScript –  PDF
2. P. Semukhin, Prime models of finite computable dimension, J. Symbolic Logic, 74 (2009), No 1, 336–348.
    PostScript –  PDF
3. B. Khoussainov, P. Semukhin, F. Stephan, Applications of Kolmogorov complexity to computable model theory, J. Symbolic Logic, 72 (2007), No 3, 1041–1054.
    PostScript –  PDF
4. A. Nies, P. Semukhin, Finite automata presentable abelian groups, Logical Foundations of Computer Science, 422–436, Lecture Notes in Computer Science, 4514, Springer, Berlin, 2007.
    PostScript –  PDF
5. B. Khoussainov, T. Slaman, P. Semukhin, Π⁰₁-presentations of algebras, Arch. Math. Logic 45 (2006), No 6, 769–781.
    PostScript –  PDF
6. D. Hirschfeldt, B. Khoussainov, P. Semukhin, An uncountably categorical theory whose only computably presentable model is saturated, Notre Dame J. Formal Logic 47 (2006), No 1, 63–71.
    PostScript –  PDF
7. P. Semukhin, Degree spectra of definable relations on Boolean algebras, Sibirsk. Mat. Zh. 46 (2005), No 4, 928–941; translation in Siberian Math. J. 46 (2005), No 4, 740–750.
    PostScript –  PDF (in English)
    PostScript –  PDF (in Russian)
8. P. Semukhin, Spectrum of the ideal of atomless elements in a recursive Boolean algebra, Vestnik NGU, Ser. Mat. Mekh. Inform. (Bull. of Novosibirsk State Univ., Series: math., mech. and informatics) 1 (2001), No 2, 108–111.

Conference talks and refereed abstracts in conference proceedings:

1. Uncountable automatic classes and learning,
   Algorithmic Learning Theory, Porto, October, 2009.
2. Prime models of finite computable dimension,
   Computability in Europe, Heidelberg, July, 2009.
3. Finite automata presentable abelian groups,
   Logical Foundations of Computer Science symposium, New York, June, 2007.
4. Applications of Kolmogorov complexity to computable model theory,
   Workshop on Computability, Randomness and Model Theory, Auckland, 2006.
5. On Π⁰₁-presentations of algebras,
   The 9th Asian Logic Conference, Novosibirsk, August, 2005.
6. Spectrum of the Atomless Elements Ideal,
   Proceedings of the workshop "Computability and models", Almaty, June 24–28, 2002.