Julia F. Knight
#61,936
Most Influential Person Now
American mathematician
Julia F. Knight's AcademicInfluence.com Rankings
Julia F. Knightmathematics Degrees
Mathematics
#4245
World Rank
#6072
Historical Rank
#1481
USA Rank
Group Theory
#215
World Rank
#254
Historical Rank
#44
USA Rank
Algebra
#469
World Rank
#634
Historical Rank
#89
USA Rank
Measure Theory
#3258
World Rank
#3851
Historical Rank
#943
USA Rank
Download Badge
Mathematics
Julia F. Knight's Degrees
- PhD Mathematics Princeton University
- Masters Mathematics Stanford University
Why Is Julia F. Knight Influential?
(Suggest an Edit or Addition)According to Wikipedia, Julia Frandsen Knight is an American mathematician, specializing in model theory and computability theory. She is the Charles L. Huisking Professor of Mathematics at the University of Notre Dame and director of the graduate program in mathematics there.
Julia F. Knight's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Computable structures and the hyperarithmetical hierarchy (2000) (468)
- Algebraic number fields (2006) (243)
- coding in (186)
- Generic Copies of Countable Structures (1989) (153)
- Degrees coded in jumps of orderings (1986) (150)
- Computable Structure and Non-Structure Theorems (2002) (122)
- Enumerations in computable structure theory (2005) (100)
- Pairs of Recursive Structures (1990) (82)
- Comparing Classes of Finite Structures (2004) (69)
- DEFINABLE SETS IN ORDERED STRUCTURES. II (2010) (65)
- Jumps of orderings (1990) (61)
- Isomorphism relations on computable structures (2012) (60)
- Orderings with th jump degree 0 (1992) (57)
- Computable Boolean algebras (2000) (56)
- Turing computable embeddings (2007) (53)
- Index sets of computable structures (2006) (41)
- Bounding prime models (2004) (32)
- Intrinsic bounds on complexity and definability at limit levels (2009) (32)
- Real closed fields and models of Peano arithmetic (2012) (31)
- Describing free groups (2012) (28)
- Mixed systems (1994) (28)
- Classification from a Computable Viewpoint (2006) (26)
- Computable trees of Scott rank ω1CK, and computable approximation (2006) (26)
- Computable Model Theory (2014) (24)
- Models of arithmetic and closed ideals (1982) (23)
- Decidability for a temporal logic used in discrete-event system analysis (1990) (22)
- A metatheorem for constructions by finitely many workers (1990) (22)
- Classes of Ulm type and coding rank-homogeneous trees in other structures (2011) (22)
- 1 1 relations and paths through O (2004) (22)
- Relatively recursive expansions II (1992) (22)
- Shrinking, stretching, and codes for homogeneous structures (1987) (21)
- Π11 relations and paths through (2004) (21)
- Nonarithmetical ℵ0-categorical theories with recursive models (1994) (21)
- Permitting, Forcing, and Copying of a Given Recursive Relation (1997) (20)
- A complete Lω1ω-sentence characterizing ℵ1 (1977) (19)
- Expansions of models and turing degrees (1982) (19)
- Barwise: Infinitary Logic and Admissible Sets (2004) (18)
- Possible Degrees in Recursive Copies II (1997) (18)
- Index sets for classes of high rank structures (2007) (17)
- Two theorems on degrees of models of true arithmetic (1984) (16)
- Computable structures of Scott rank ω CK 1 in familiar classes (2005) (16)
- Orderings with αth jump degree 0(α) (1992) (16)
- Quasi-Simple Relations in Copies of a Given Recursive Structure (1997) (15)
- Constructions by Transfinitely Many Workers (1990) (15)
- COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS (2014) (15)
- Recursive Structures and Ershov's Hierarchy (1996) (15)
- Possible Degrees in Recursive Copies (1995) (14)
- Degrees of models with prescribed Scott set (1987) (14)
- Algebraic independence (1981) (13)
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES (2018) (13)
- Prime and atomic models (1978) (12)
- Effective Construction of Models (1986) (12)
- Index sets and Scott sentences (2014) (12)
- Complexity of structures associated with real closed fields (2013) (12)
- Algebraic structure and computable structure (2005) (11)
- A ug 2 00 5 Computable structures of rank ω CK 1 (2022) (11)
- Scott sentences for certain groups (2016) (10)
- Generic expansions of structures (1973) (9)
- Some new computable structures of high rank (2016) (9)
- True Approximations and Models of Arithmetic (1999) (9)
- On Automorphic Tuples of Elements in Computable Models (2005) (9)
- Effective Mathematics of the Uncountable: Computable structure theory using admissible recursion theory on ω1 using admissibility (2013) (8)
- Hanf numbers for omitting types over particular theories (1976) (8)
- Ramified Systems (1994) (8)
- Omitting types in set theory and arithmetic (1976) (8)
- A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas (1994) (8)
- Computable embeddings and strongly minimal theories (2007) (8)
- Real closed exponential fields (2011) (8)
- Chapter 7 Degrees of models (1998) (8)
- Degrees of types and independent sequences (1983) (7)
- Decidability and Computability of Certain Torsion-Free Abelian Groups (2010) (7)
- Saturation of homogeneous resplendent models (1986) (6)
- Lengths of developments in K((G)) (2019) (6)
- Simple and immune relations on countable structures (2003) (6)
- The computable embedding problem (2012) (6)
- COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS (2017) (6)
- Theories whose resplendent models are homogeneous (1982) (6)
- COMPUTABLE STRUCTURE THEORY USING ADMISSIBLE RECURSION THEORY ON ω1 (2011) (6)
- Control Theory, Modal Logic and Games (1996) (6)
- Sequences of n-diagrams (2002) (6)
- Limit computable integer parts (2011) (6)
- Additive structure in uncountable models for a fixed completion of P (1983) (6)
- Chains and antichains in partial orderings (2009) (6)
- COMPARING TWO VERSIONS OF THE REALS (2016) (5)
- The Arithmetical Hierarchy in the Setting of ω1 (2013) (5)
- Types omitted in uncountable models of arithmetic (1975) (5)
- Complexity of Scott sentences (2018) (5)
- Spectra of Atomic Theories (2009) (5)
- Minimality and completions of PA (2001) (5)
- Classes of structures with universe a subset of ω1 (2013) (5)
- Relatively recursive expansions (2007) (4)
- Corrigendum to: “Real closed fields and models of arithmetic” (2012) (4)
- Computable Structures of Rank (2010) (4)
- Requirement systems (1995) (4)
- An example related to Gregory’s Theorem (2013) (4)
- A Complete $L_{\omega 1\omega}$-Sentence Characterizing $\mathbf{\aleph}_1$ (1977) (3)
- Relations and Paths through O * (2004) (3)
- Coding a Family of Sets (1998) (3)
- Strong jump inversion (2018) (3)
- COUNTABLE REAL CLOSED FIELDS AND DEVELOPMENTS OF BOUNDED LENGTH (2010) (3)
- Pairs of computable structures (1990) (3)
- A complete theory with arbitrarily large minimality ranks (1983) (3)
- Strongly minimal theories with recursive models (2018) (3)
- Using computability to measure complexity of algebraic structures and classes of structures (2014) (3)
- Representing Scott sets in algebraic settings (2014) (3)
- Review: Jon Barwise, John Schlipf, An Introduction to Recursively Saturated and Resplendent Models (1982) (3)
- Computable structures of Scott rank (2011) (2)
- Relatively Hyperimmune Relations on Structures (2004) (2)
- Complete types and the natural numbers (1973) (2)
- Skolem functions and elementary embeddings (1977) (2)
- Comparing Classes of Finite Sums (2016) (2)
- CODING IN GRAPHS AND LINEAR ORDERINGS (2019) (2)
- Categoricity of computable infinitary theories (2009) (2)
- Review: J. P. Ressayre, Models with Compactness Properties Relative to an Admissible Language (1982) (2)
- Computable Trees of Scott Rank $\omega {1}^{\mathit{CK}}$ , and Computable Approximation (2006) (2)
- Roots of polynomials in fields of generalized power series (2017) (2)
- Gregory John. Uncountable models and infinitary elementary extensions. The journal of symbolic logic , vol. 38 (1973), pp. 460–470. (1982) (1)
- Preserving Categoricity and Complexity of Relations (2015) (1)
- An inelastic model with indiscernibles (1978) (1)
- Computable structures of rank omega (ck)(1) (2010) (1)
- The arithmetical hierarchy in the setting of $ \ omega _ 1 $ (2016) (1)
- Π₁¹ Relations and Paths through ᵊ (2004) (1)
- Real closed fields and models of arithmetic (vol 75, pg 1, 2010) (2012) (1)
- INTERPRETING A FIELD IN ITS HEISENBERG GROUP (2020) (1)
- Hanf number for Scott sentences of computable structures (2018) (0)
- Erratum to: Limit computable integer parts (2015) (0)
- F U N D a M E N T a Mathematicae Recursive Expansions (2007) (0)
- Algorithmic Relationships of Relations S n L on Linear Orders (2022) (0)
- Meeting of the Association for Symbolic Logic (1988) (0)
- Workshop on Computability Theory 2019 Leeds , UK — July 22 & 23 , 2019 Schedule (0)
- D ec 2 01 1 Real closed exponential fields (2011) (0)
- COPYING ONE OF A PAIR OF STRUCTURES (2021) (0)
- The a rithmetical hierarchy in the sett ing of $\omega_1$ (2013) (0)
- Erratum to: Limit computable integer parts (2015) (0)
- Scott sentences for certain groups (2017) (0)
- 1 Problems and results 1 . 1 Problems related to Vaught ’ s Conjecture (2012) (0)
- Free structures and limiting density (2022) (0)
- Trees of Scot rank ω 1 CK , and computable approximability (2016) (0)
- 1994 Annual Meeting of the Association for Symbolic Logic (1995) (0)
- Creating Online Archives: Some Issues (2012) (0)
- Phoenix Civic Plaza, Phoenix, Arizona, January 9–10, 2004 (2004) (0)
- University of California, San Diego, March 20–23, 1999 (1999) (0)
- A Complete L omega 1omega -Sentence Characterizing N1 (1977) (0)
- L O ] 2 2 M ar 2 00 8 Structures in Familiar Classes Which Have Scott Rank ω CK 1 (2008) (0)
- The Selective Nature of Mass Availability Online (2012) (0)
- 1994–1995 Winter Meeting of the Association for Symbolic Logic (1995) (0)
- Representing Scott sets in algebraic settings (2015) (0)
- Index sets and Scott sentences (2014) (0)
- The computable embedding problem (2012) (0)
- Meeting of the Association for Symbolic Logic: San Antonio, 1987 (1988) (0)
- 2021 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC (2021) (0)
- Sequences of degrees associated with models of arithmetic (2005) (0)
- 2014 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM ’14 Vienna, AUSTRIA July 14–19, 2014 (2015) (0)
- Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984 (1985) (0)
- Orderings with $\alpha$th jump degree ${\bf 0}\sp {(\alpha)}$ (1992) (0)
- Computable structures of rank omega_1^{CK} (2005) (0)
- Strong initial segments of models of (2007) (0)
- Well Quasi-orderings and Roots of Polynomials in a Hahn Field (2020) (0)
- Meeting of the Association for Symbolic Logic (1985) (0)
- Comparing Classes of Finite Sums (2016) (0)
- Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018 (2019) (0)
- Notices (2002) (0)
- Structures in Familiar Classes Which Have Scott Rank $\omega_1^{CK}$ (2008) (0)
- Models of arithmetic: quantifiers and complexity (2016) (0)
- Lengths of developments in K((G)) (2019) (0)
- Nonarithmetical aleph0-Categorical Theories with Recursive Models (1994) (0)
- An example related to Gregory’s Theorem (2013) (0)
- Computability Theory (2019) (0)
- ORDERINGS WITH lTH JUMP DEGREE 0(a) (2016) (0)
- Preserving Categoricity and Complexity of Relations (2015) (0)
- Hella, L., Kolaitis, PG and Luosto, K., How to define a linear (1997) (0)
- Pi11 relations and paths through (2004) (0)
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER (2022) (0)
- 2022 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Cornell University Ithaca, NY, USA April 7–10, 2022 (2022) (0)
- Hanf number for Scott sentences of computable structures (2016) (0)
This paper list is powered by the following services:
Other Resources About Julia F. Knight
What Schools Are Affiliated With Julia F. Knight?
Julia F. Knight is affiliated with the following schools:
