Julia F. Knight

Publication Activity (10 Years)

Years Active: 1973-2023
Publications (10 Years): 14

Top Topics

Continuous Functions

Extractive Summarization

Computational Power

Top Venues

Arch. Math. Log.

J. Log. Comput.

Publications

Uri Andrews, Julia F. Knight, Rutger Kuyper, Joseph S. Miller, Mariya Ivanova Soskova
Expanding the Reals by continuous Functions Adds no Computational Power. J. Symb. Log. 88 (3) (2023)
Rachael Alvir, Wesley Calvert, Grant Goodman, Valentina S. Harizanov, Julia F. Knight, Russell G. Miller, Andrey S. Morozov, Alexandra A. Soskova, Rose Weisshaar
Interpreting a field in its Heisenberg Group. J. Symb. Log. 87 (3) (2022)
Rachael Alvir, Hannah Burchfield, Julia F. Knight
Copying One of a Pair of Structures. J. Symb. Log. 87 (3) (2022)
Julia F. Knight, Alexandra A. Soskova, Stefan V. Vatev
Coding in graphs and linear Orderings. J. Symb. Log. 85 (2) (2020)
Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp
Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. Comput. 8 (3-4) (2019)
Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky
Uniform Procedures in uncountable Structures. J. Symb. Log. 83 (2) (2018)
Sergey Goncharov, Julia F. Knight, Ioannis A. Souldatos
Hanf number for Scott sentences of computable structures. Arch. Math. Log. 57 (7-8) (2018)
Julia F. Knight, Vikram Saraph
Scott sentences for certain groups. Arch. Math. Log. 57 (3-4) (2018)
Wesley Calvert, Andrey N. Frolov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Alexandra A. Soskova, Stefan V. Vatev
Strong jump inversion. J. Log. Comput. 28 (7) (2018)
Gregory Igusa, Julia F. Knight, Noah David Schweber
Computing strength of Structures Related to the field of Real numbers. J. Symb. Log. 82 (1) (2017)
Julia F. Knight, Antonio Montalbán, Noah David Schweber
Computable Structures in Generic Extensions. J. Symb. Log. 81 (3) (2016)
Gregory Igusa, Julia F. Knight
Comparing two Versions of the Reals. J. Symb. Log. 81 (3) (2016)
Alf Dolich, Julia F. Knight, Karen M. Lange, David Marker
Representing Scott sets in algebraic settings. Arch. Math. Log. 54 (5-6) (2015)
Paola D'Aquino, Julia F. Knight, Karen M. Lange
Erratum to: Limit computable integer parts. Arch. Math. Log. 54 (3-4) (2015)
Julia F. Knight, Charles F. D. McCoy
Index sets and Scott sentences. Arch. Math. Log. 53 (5-6) (2014)
Ekaterina B. Fokina, Sy-David Friedman, Julia F. Knight, Russell G. Miller
. J. Log. Comput. 23 (6) (2013)
Uri Andrews, Julia F. Knight
Spectra of atomic theories. J. Symb. Log. 78 (4) (2013)
Jesse Johnson, Julia F. Knight, V. Ocasio, S. VanDenDriessche
An example related to Gregory's Theorem. Arch. Math. Log. 52 (3-4) (2013)
Jacob Carson, Jesse Johnson, Julia F. Knight, Karen M. Lange, Charles F. D. McCoy, John Wallbaum
. Comput. 2 (2) (2013)
Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán
Isomorphism relations on computable structures. J. Symb. Log. 77 (1) (2012)
Paola D'Aquino, Julia F. Knight, Sergei Starchenko
Corrigendum to: "Real closed fields and models of arithmetic". J. Symb. Log. 77 (2) (2012)
Ekaterina B. Fokina, Julia F. Knight, Alexander G. Melnikov, Sara Quinn, C. Safranski
Classes of Ulm type and coding rank-homogeneous trees in other structures. J. Symb. Log. 76 (3) (2011)
Paola D'Aquino, Julia F. Knight, Karen M. Lange
Limit computable integer parts. Arch. Math. Log. 50 (7-8) (2011)
Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51 (1) (2010)
Julia F. Knight, Jessica Millar
Computable Structures of Rank. J. Math. Log. 10 (1-2) (2010)
Paola D'Aquino, Julia F. Knight, Sergei Starchenko
Real closed fields and models of Peano arithmetic. J. Symb. Log. 75 (1) (2010)
Wesley Calvert, Sergei S. Goncharov, Julia F. Knight, Jessica Millar
Categoricity of computable infinitary theories. Arch. Math. Log. 48 (1) (2009)
John Chisholm, Ekaterina B. Fokina, Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Sara Quinn
Intrinsic bounds on complexity and definability at limit levels. J. Symb. Log. 74 (3) (2009)
Valentina S. Harizanov, Carl G. Jockusch Jr., Julia F. Knight
Chains and antichains in partial orderings. Arch. Math. Log. 48 (1) (2009)
Wesley Calvert, Ekaterina B. Fokina, Sergei S. Goncharov, Julia F. Knight, Oleg V. Kudinov, Andrei S. Morozov, Vadim Puzarenko
Index sets for classes of high rank structures. J. Symb. Log. 72 (4) (2007)
John Chisholm, Julia F. Knight, Sara Miller
Computable embeddings and strongly minimal theories. J. Symb. Log. 72 (3) (2007)
Julia F. Knight, Sara Miller, Michael Vanden Boom
Turing computable embeddings. J. Symb. Log. 72 (3) (2007)
Wesley Calvert, Julia F. Knight, Jessica Millar
, and computable approximation. J. Symb. Log. 71 (1) (2006)
Wesley Calvert, Julia F. Knight
Classification from a Computable Viewpoint. Bull. Symb. Log. 12 (2) (2006)
Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell G. Miller, Reed Solomon
Enumerations in computable structure theory. Ann. Pure Appl. Log. 136 (3) (2005)
H. Jerome Keisler, Julia F. Knight
Barwise: infinitary logic and admissible sets. Bull. Symb. Log. 10 (1) (2004)
Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare
Bounding prime models. J. Symb. Log. 69 (4) (2004)
Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Richard A. Shore
relations and paths through. J. Symb. Log. 69 (2) (2004)
Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy
Simple and immune relations on countable structures. Arch. Math. Log. 42 (3) (2003)
Valentina S. Harizanov, Julia F. Knight, Andrei S. Morozov
Sequences of n-Diagrams. J. Symb. Log. 67 (3) (2002)
Julia F. Knight
Minimality and Completions of PA. J. Symb. Log. 66 (3) (2001)
Julia F. Knight, Michael Stob
Computable Boolean Algebras. J. Symb. Log. 65 (4) (2000)
Julia F. Knight
Coding a Family of Sets. Ann. Pure Appl. Log. 94 (1-3) (1998)
Christopher J. Ash, Julia F. Knight, Jeffrey B. Remmel
Quasi-Simple Relations in Copies of a Given Recursive Structure. Ann. Pure Appl. Log. 86 (3) (1997)
Christopher J. Ash, Julia F. Knight
Possible Degrees in Recursive Copies II. Ann. Pure Appl. Log. 87 (2) (1997)
Christopher J. Ash, Peter Cholak, Julia F. Knight
Permitting, Forcing, and Copying of a Given Recursive Relation. Ann. Pure Appl. Log. 86 (3) (1997)
Christopher J. Ash, Julia F. Knight
Recursive Structures and Ershov's Hierarchy. Math. Log. Q. 42 (1996)
Julia F. Knight, Brian Luense
Control Theory, Modal Logic and Games. Hybrid Systems (1996)
Julia F. Knight
Requirement Systems. J. Symb. Log. 60 (1) (1995)
Christopher J. Ash, Julia F. Knight
Possible Degrees in Recursive Copies. Ann. Pure Appl. Log. 75 (3) (1995)
Julia F. Knight
-Categorical Theories with Recursive Models. J. Symb. Log. 59 (1) (1994)
Christopher J. Ash, Julia F. Knight
Mixed Systems. J. Symb. Log. 59 (4) (1994)
Christopher J. Ash, Julia F. Knight
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas. Math. Log. Q. 40 (1994)
Christopher J. Ash, Julia F. Knight
Ramified Systems. Ann. Pure Appl. Log. 70 (3) (1994)
Christopher J. Ash, Julia F. Knight
Pairs of Recursive Structures. Ann. Pure Appl. Log. 46 (3) (1990)
Julia F. Knight
Constructions by Transfinitely Many Workers. Ann. Pure Appl. Log. 48 (3) (1990)
Julia F. Knight
A Metatheorem for Constructions by Finitely Many Workers. J. Symb. Log. 55 (2) (1990)
Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman
Generic Copies of Countable Structures. Ann. Pure Appl. Log. 42 (3) (1989)
Julia F. Knight
Meeting of the Association for Symbolic Logic: San Antonio, 1987. J. Symb. Log. 53 (3) (1988)
Julia F. Knight
Saturation of Homogeneous Resplendent Models. J. Symb. Log. 51 (1) (1986)
Julia F. Knight
Degrees Coded in Jumps of Orderings. J. Symb. Log. 51 (4) (1986)
John T. Baldwin, Matt Kaufmann, Julia F. Knight
Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984. J. Symb. Log. 50 (1) (1985)
Julia F. Knight, Alistair H. Lachlan, Robert I. Soare
Two Theorems on Degrees of Models of True Arithmetic. J. Symb. Log. 49 (2) (1984)
Robert E. Woodrow, Julia F. Knight
A Complete Theory with Arbitrarily Large Minimality Ranks. J. Symb. Log. 48 (2) (1983)
Julia F. Knight
Additive Structure in Uncountable Models for a Fixed Completion of P. J. Symb. Log. 48 (3) (1983)
Julia F. Knight
Degrees of Types and Independent Sequences. J. Symb. Log. 48 (4) (1983)
Julia F. Knight, Mark E. Nadel
Models of Arithmetic and Closed Ideals. J. Symb. Log. 47 (4) (1982)
Julia F. Knight, Mark E. Nadel
Expansions of Models and Turing Degrees. J. Symb. Log. 47 (3) (1982)
Julia F. Knight
Algebraic Independence. J. Symb. Log. 46 (2) (1981)
Julia F. Knight
An Inelastic Model with Indiscernibles. J. Symb. Log. 43 (2) (1978)
Julia F. Knight
Prime and Atomic Models. J. Symb. Log. 43 (3) (1978)
Julia F. Knight
Skolem Functions and Elementary Embeddings. J. Symb. Log. 42 (1) (1977)
Julia F. Knight
. J. Symb. Log. 42 (1) (1977)
Julia F. Knight
Hanf Numbers for Omitting Types Over Particular Theories. J. Symb. Log. 41 (3) (1976)
Julia F. Knight
Omitting Types in Set Theory and Arithmetic. J. Symb. Log. 41 (1) (1976)
Julia F. Knight
Types Omitted in Uncountable Models of Arithmetic. J. Symb. Log. 40 (3) (1975)
Julia F. Knight
Complete Types and the Natural Numbers. J. Symb. Log. 38 (3) (1973)
Julia F. Knight
Generic Expansions of Structures. J. Symb. Log. 38 (4) (1973)