Julia F. Knight
Professor, Charles L. Huisking
B.A., Utah State University, 1964
Ph.D., University of California, Berkeley, 1972
Email: Julia.F.Knight.1@nd.edu
Office: 285 Hurley Hall
Phone: (574) 6316355
Fax: (574) 6316579
Research Interests
My interests are in Logic and Computable Structure Theory. Initially, my research was in model theory, working on models of arithmetic and infinitary logic. Gradually, my interests shifted to computability, and I am interested in the relationship between computability and definability in familiar kinds of mathematical structures: linear orderings, vector spaces, etc. I am also interested in abstract problems on the technology used in this area.
My students have obtained results on computability questions about groups, Boolean algebras, and models of arithmetic.
Selected Publications

Chisholm, John; Fokina, Ekaterina B.; Goncharov, Sergey S.; Harizanov, Valentina S.; Knight, Julia F.;Quinn, Sara Intrinsic bounds on complexity and definability at limit levels. J. Symbolic Logic 74 (2009), no. 3, 10471060.

D'Aquino, Paola; Knight, Julia F. Strong initial segments of models of ${\rm I}\Delta_0$. Fund. Math. 195 (2007), no. 2, 155176.

Calvert, W.; Goncharov, S. S.; Knight, J. F. Computable structures of Scott rank $\omega_1^{\rm CK}$ in familiar classes. Advances in logic, 4966, Contemp. Math., 425, Amer. Math. Soc., Providence, RI, 2007.

Ash, C. J.; Knight, J.(1NDM) Computable structures and the hyperarithmetical hierarchy. Studies in Logic and the Foundations of Mathematics, 144. NorthHolland Publishing Co., Amsterdam, 2000. xvi+346 pp.
If you have access to MathSciNet you can see a complete list of publications.
Please direct questions and comments to: Julia.F.Knight.1@nd.edu