Bakhadyr Khoussainov

Adjunct Professor of Mathematics

Web Site www.cs.auckland.ac.nz/~bmk/ Contact Information Office:  N/A Phone:  N/A Fax:  (607) 255-7149 Email:  bmk@math.cornell.edu Courses & Office Hours

Education

Ph.D. (1987) Novosibirsk University

Research Area: logic, computable model theory, automatic structures and automata

My research interests mostly concern the theory of computable and automatic structures. While the theory of computable structures is based on the most general models of computations such as Turing machines; the theory of automatic structures is based on computations that require a finite fixed amount of space. Both topics are exciting, possess their own beauty, applications and challanges.

Selected Publications

An uncountably categorical theory whose only computably presentable model is saturated (with D. Hirshfeldt and P. Semukhin), Notre Dame Journal of Formal Logic 47 no. 1 (2006), 63–71.

Automatic structures: richness and limitations (with A. Nies, S. Rubin, and F. Stephan), Logical Methods in Computer Science 3 (2007).

Applications of Kolmogorov complexity to computable model theory (with P. Semukhin and F. Stephan), Journal for Symbolic Logic (to appear).

On the computability theoretic complexity of trivial strongly minimal models (with M. Lakowski, S. Lempp, and R. Solomon), Proceedings of the AMS (accepted).

Last modified: January 3, 2008