Complete Types and the Natural Numbers. - Julia F. Knight (J. Symb. Log., 1973)

Generic Expansions of Structures. - Julia F. Knight (J. Symb. Log., 1973)

Types Omitted in Uncountable Models of Arithmetic. - Julia F. Knight (J. Symb. Log., 1975)

Omitting Types in Set Theory and Arithmetic. - Julia F. Knight (J. Symb. Log., 1976)

Hanf Numbers for Omitting Types Over Particular Theories. - Julia F. Knight (J. Symb. Log., 1976)

A Complete L omega 1omega -Sentence Characterizing N1. - Julia F. Knight (J. Symb. Log., 1977)

Skolem Functions and Elementary Embeddings. - Julia F. Knight (J. Symb. Log., 1977)

An Inelastic Model with Indiscernibles. - Julia F. Knight (J. Symb. Log., 1978)

Prime and Atomic Models. - Julia F. Knight (J. Symb. Log., 1978)

Algebraic Independence. - Julia F. Knight (J. Symb. Log., 1981)

Expansions of Models and Turing Degrees. - Julia F. Knight; Mark E. Nadel (J. Symb. Log., 1982)

Models of Arithmetic and Closed Ideals. - Julia F. Knight; Mark E. Nadel (J. Symb. Log., 1982)

Additive Structure in Uncountable Models for a Fixed Completion of P. - Julia F. Knight (J. Symb. Log., 1983)

Degrees of Types and Independent Sequences. - Julia F. Knight (J. Symb. Log., 1983)

A Complete Theory with Arbitrarily Large Minimality Ranks. - Robert E. Woodrow; Julia F. Knight (J. Symb. Log., 1983)

Two Theorems on Degrees of Models of True Arithmetic. - Julia F. Knight; Alistair H. Lachlan; Robert I. Soare (J. Symb. Log., 1984)

Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984. - John T. Baldwin 001; Matt Kaufmann; Julia F. Knight (J. Symb. Log., 1985)

Saturation of Homogeneous Resplendent Models. - Julia F. Knight (J. Symb. Log., 1986)

Degrees Coded in Jumps of Orderings. - Julia F. Knight (J. Symb. Log., 1986)

Meeting of the Association for Symbolic Logic: San Antonio, 1987. - Julia F. Knight (J. Symb. Log., 1988)

Generic Copies of Countable Structures. - Christopher J. Ash; Julia F. Knight; Mark S. Manasse; Theodore A. Slaman (Ann. Pure Appl. Log., 1989)

Pairs of Recursive Structures. - Christopher J. Ash; Julia F. Knight (Ann. Pure Appl. Log., 1990)

Constructions by Transfinitely Many Workers. - Julia F. Knight (Ann. Pure Appl. Log., 1990)

A Metatheorem for Constructions by Finitely Many Workers. - Julia F. Knight (J. Symb. Log., 1990)

Ramified Systems. - Christopher J. Ash; Julia F. Knight (Ann. Pure Appl. Log., 1994)

Mixed Systems. - Christopher J. Ash; Julia F. Knight (J. Symb. Log., 1994)

Nonarithmetical aleph0-Categorical Theories with Recursive Models. - Julia F. Knight (J. Symb. Log., 1994)

A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas. - Christopher J. Ash; Julia F. Knight (Math. Log. Q., 1994)

Possible Degrees in Recursive Copies. - Christopher J. Ash; Julia F. Knight (Ann. Pure Appl. Log., 1995)

Requirement Systems. - Julia F. Knight (J. Symb. Log., 1995)

Control Theory, Modal Logic and Games. - Julia F. Knight; Brian Luense (Hybrid Systems, 1996)

Recursive Structures and Ershov's Hierarchy. - Christopher J. Ash; Julia F. Knight (Math. Log. Q., 1996)

Permitting, Forcing, and Copying of a Given Recursive Relation. - Christopher J. Ash; Peter Cholak; Julia F. Knight (Ann. Pure Appl. Log., 1997)

Possible Degrees in Recursive Copies II. - Christopher J. Ash; Julia F. Knight (Ann. Pure Appl. Log., 1997)

Quasi-Simple Relations in Copies of a Given Recursive Structure. - Christopher J. Ash; Julia F. Knight; Jeffrey B. Remmel (Ann. Pure Appl. Log., 1997)

Coding a Family of Sets. - Julia F. Knight (Ann. Pure Appl. Log., 1998)

Computable Boolean Algebras. - Julia F. Knight; Michael Stob (J. Symb. Log., 2000)

Minimality and Completions of PA. - Julia F. Knight (J. Symb. Log., 2001)

Sequences of n-Diagrams. - Valentina S. Harizanov; Julia F. Knight; Andrei S. Morozov (J. Symb. Log., 2002)

Simple and immune relations on countable structures. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy (Arch. Math. Log., 2003)

Barwise: infinitary logic and admissible sets. - H. Jerome Keisler; Julia F. Knight (Bull. Symb. Log., 2004)

Bounding prime models. - Barbara F. Csima; Denis R. Hirschfeldt; Julia F. Knight; Robert I. Soare (J. Symb. Log., 2004)

Pi11 relations and paths through. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Richard A. Shore (J. Symb. Log., 2004)

Enumerations in computable structure theory. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy; Russell G. Miller; Reed Solomon (Ann. Pure Appl. Log., 2005)

Classification from a Computable Viewpoint. - Wesley Calvert; Julia F. Knight (Bull. Symb. Log., 2006)

Computable trees of Scott rank ω1CK, and computable approximation. - Wesley Calvert; Julia F. Knight; Jessica Millar (J. Symb. Log., 2006)

Index sets for classes of high rank structures. - Wesley Calvert; Ekaterina B. Fokina; Sergei S. Goncharov; Julia F. Knight; Oleg V. Kudinov; Andrei S. Morozov; Vadim Puzarenko (J. Symb. Log., 2007)

Computable embeddings and strongly minimal theories. - John Chisholm; Julia F. Knight; Sara Miller (J. Symb. Log., 2007)

Turing computable embeddings. - Julia F. Knight; Sara Miller; Michael Vanden Boom (J. Symb. Log., 2007)

Categoricity of computable infinitary theories. - Wesley Calvert; Sergei S. Goncharov; Julia F. Knight; Jessica Millar (Arch. Math. Log., 2009)

Chains and antichains in partial orderings. - Valentina S. Harizanov; Carl G. Jockusch Jr.; Julia F. Knight (Arch. Math. Log., 2009)

Intrinsic bounds on complexity and definability at limit levels. - John Chisholm; Ekaterina B. Fokina; Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Sara Quinn (J. Symb. Log., 2009)

Computable Structures of Rank. - Julia F. Knight; Jessica Millar (J. Math. Log., 2010)

Real closed fields and models of Peano arithmetic. - Paola D'Aquino; Julia F. Knight; Sergei Starchenko (J. Symb. Log., 2010)

Decidability and Computability of Certain Torsion-Free Abelian Groups. - Rodney G. Downey; Sergei S. Goncharov; Asher M. Kach; Julia F. Knight; Oleg V. Kudinov; Alexander G. Melnikov; Daniel Turetsky (Notre Dame J. Formal Log., 2010)

Limit computable integer parts. - Paola D'Aquino; Julia F. Knight; Karen M. Lange (Arch. Math. Log., 2011)

Classes of Ulm type and coding rank-homogeneous trees in other structures. - Ekaterina B. Fokina; Julia F. Knight; Alexander G. Melnikov; Sara Quinn; C. Safranski (J. Symb. Log., 2011)

Corrigendum to: "Real closed fields and models of arithmetic". - Paola D'Aquino; Julia F. Knight; Sergei Starchenko (J. Symb. Log., 2012)

Isomorphism relations on computable structures. - Ekaterina B. Fokina; Sy-David Friedman; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy; Antonio Montalbán (J. Symb. Log., 2012)

An example related to Gregory's Theorem. - Jesse Johnson; Julia F. Knight; V. Ocasio; S. VanDenDriessche (Arch. Math. Log., 2013)

The Arithmetical Hierarchy in the Setting of ω1. - Jacob Carson; Jesse Johnson; Julia F. Knight; Karen M. Lange; Charles F. D. McCoy; John Wallbaum (Comput., 2013)

Spectra of atomic theories. - Uri Andrews; Julia F. Knight (J. Symb. Log., 2013)

Classes of structures with universe a subset of ω1. - Ekaterina B. Fokina; Sy-David Friedman; Julia F. Knight; Russell G. Miller (J. Log. Comput., 2013)

Index sets and Scott sentences. - Julia F. Knight; Charles F. D. McCoy (Arch. Math. Log., 2014)

Erratum to: Limit computable integer parts. - Paola D'Aquino; Julia F. Knight; Karen M. Lange (Arch. Math. Log., 2015)

Representing Scott sets in algebraic settings. - Alf Dolich; Julia F. Knight; Karen M. Lange; David Marker (Arch. Math. Log., 2015)

Comparing two Versions of the Reals. - Gregory Igusa; Julia F. Knight (J. Symb. Log., 2016)

Computable Structures in Generic Extensions. - Julia F. Knight; Antonio Montalbán; Noah David Schweber (J. Symb. Log., 2016)

Computing strength of Structures Related to the field of Real numbers. - Gregory Igusa; Julia F. Knight; Noah David Schweber (J. Symb. Log., 2017)

Hanf number for Scott sentences of computable structures. - Sergey Goncharov 002; Julia F. Knight; Ioannis A. Souldatos (Arch. Math. Log., 2018)

Scott sentences for certain groups. - Julia F. Knight; Vikram Saraph (Arch. Math. Log., 2018)

Uniform Procedures in uncountable Structures. - Noam Greenberg; Alexander G. Melnikov; Julia F. Knight; Daniel Turetsky (J. Symb. Log., 2018)

Strong jump inversion. - Wesley Calvert; Andrey N. Frolov; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy; Alexandra A. Soskova; Stefan V. Vatev (J. Log. Comput., 2018)

Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. - Vasco Brattka; Rod Downey; Julia F. Knight; Steffen Lempp (Comput., 2019)

Coding in graphs and linear Orderings. - Julia F. Knight; Alexandra A. Soskova; Stefan V. Vatev (J. Symb. Log., 2020)

Copying One of a Pair of Structures. - Rachael Alvir; Hannah Burchfield; Julia F. Knight (J. Symb. Log., 2022)

Interpreting a field in its Heisenberg Group. - Rachael Alvir; Wesley Calvert; Grant Goodman; Valentina S. Harizanov; Julia F. Knight; Russell G. Miller; Andrey S. Morozov; Alexandra A. Soskova; Rose Weisshaar (J. Symb. Log., 2022)

Expanding the Reals by continuous Functions Adds no Computational Power. - Uri Andrews; Julia F. Knight; Rutger Kuyper; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2023)