Pavel Semukhin

Postdoctoral Researcher
Kurt Gödel Research Center
Vienna, Austria

Email:   





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


PhD Thesis:
    Topics in Computable Model Theory, The University of Auckland, 2008.
    PostScript –  PDF
 



List of Publications:
  1. R. Samei, P. Semukhin, B. Yang and S. Zilles, Sauer's bound for a notion of teaching complexity, Algorithmic Learning Theory, ALT 2012. Proceedings. Springer LNAI 7568:96–110, 2012.
     PostScript –  PDF
  2. P. Semukhin and F. Stephan, Automatic models of first-order theories, Annals of Pure and Applied Logic, accepted for publication.
     PostScript –  PDF
  3. J. Case, S. Jain, T. Le, Y. Ong, P. Semukhin and F. Stephan, Automatic learning of subclasses of pattern languages, Information and Computation, 218:17–35, 2012. Language and Automata Theory and Applications, LATA 2011. Proceedings. Springer LNCS 6638:192–203, 2011.
     PostScript –  PDF
  4. J. Case, S. Jain, Y. Ong, P. Semukhin and F. Stephan, Automatic learners with feedback queries, Computability in Europe, CiE 2011. Proceedings. Springer LNCS 6735:31–40, 2011.
     PostScript –  PDF
  5. S. Jain, Q. Luo, P. Semukhin, F. Stephan, Uncountable automatic classes and learning, Theoretical Computer Science, 412 (2011), No 19, 1805–1820. Algorithmic Learning Theory, ALT 2009. Proceedings. Springer LNAI 5809:293–307, 2009.
     PostScript –  PDF
  6. P. Semukhin, Prime models of finite computable dimension, J. Symbolic Logic, 74 (2009), No 1, 336–348.
     PostScript –  PDF
  7. 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
  8. A. Nies, P. Semukhin, Finite automata presentable abelian groups, Proc. of Logical Foundations of Computer Science, 422–436, Lecture Notes in Computer Science, 4514, Springer, Berlin, 2007. Annals of Pure and Applied Logic, 161 (2009), No 3, 458–467.
     PostScript –  PDF
  9. B. Khoussainov, T. Slaman, P. Semukhin, Π01-presentations of algebras, Arch. Math. Logic 45 (2006), No 6, 769–781.
     PostScript –  PDF
  10. 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
  11. 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)
  12. 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:
  1. Automatic models of first-order theories,
    Invited talk at AMS Spring Western Section Meeting, Honolulu, HI, March, 2012.
  2. Automatic models of first-order theories,
    Workshop on Automata Theory and Applications, Singapore, September, 2011.
  3. Uncountable automatic classes and learning,
    Algorithmic Learning Theory, Porto, October, 2009.
  4. Prime models of finite computable dimension,
    Computability in Europe, Heidelberg, July, 2009.
  5. Finite automata presentable abelian groups,
    Logical Foundations of Computer Science symposium, New York, June, 2007.
  6. Applications of Kolmogorov complexity to computable model theory,
    Workshop on Computability, Randomness and Model Theory, Auckland, 2006.
  7. On Π01-presentations of algebras,
    The 9th Asian Logic Conference, Novosibirsk, August, 2005.
  8. Spectrum of the Atomless Elements Ideal,
    Proceedings of the workshop "Computability and models", Almaty, June 24–28, 2002.