default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulia F. Knight
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j77]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): 1083-1102 (2023)- 2022
- [j76]Rachael Alvir, Hannah Burchfield, Julia F. Knight:
Copying One of a Pair of Structures. J. Symb. Log. 87(3): 1201-1214 (2022) - [j75]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): 1215-1230 (2022) - 2020
- [j74]Julia F. Knight, Alexandra A. Soskova, Stefan V. Vatev:
Coding in graphs and linear Orderings. J. Symb. Log. 85(2): 673-690 (2020)
2010 – 2019
- 2019
- [j73]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): 191 (2019) - 2018
- [j72]Julia F. Knight, Vikram Saraph:
Scott sentences for certain groups. Arch. Math. Log. 57(3-4): 453-472 (2018) - [j71]Sergey Goncharov, Julia F. Knight, Ioannis A. Souldatos:
Hanf number for Scott sentences of computable structures. Arch. Math. Log. 57(7-8): 889-907 (2018) - [j70]Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky:
Uniform Procedures in uncountable Structures. J. Symb. Log. 83(2): 529-550 (2018) - [j69]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): 1499-1522 (2018) - 2017
- [j68]Gregory Igusa, Julia F. Knight, Noah David Schweber:
Computing strength of Structures Related to the field of Real numbers. J. Symb. Log. 82(1): 137-150 (2017) - 2016
- [j67]Julia F. Knight, Antonio Montalbán, Noah David Schweber:
Computable Structures in Generic Extensions. J. Symb. Log. 81(3): 814-832 (2016) - [j66]Gregory Igusa, Julia F. Knight:
Comparing two Versions of the Reals. J. Symb. Log. 81(3): 1115-1123 (2016) - 2015
- [j65]Paola D'Aquino, Julia F. Knight, Karen M. Lange:
Erratum to: Limit computable integer parts. Arch. Math. Log. 54(3-4): 487-489 (2015) - [j64]Alf Dolich, Julia F. Knight, Karen M. Lange, David Marker:
Representing Scott sets in algebraic settings. Arch. Math. Log. 54(5-6): 631-637 (2015) - 2014
- [j63]Julia F. Knight, Charles F. D. McCoy:
Index sets and Scott sentences. Arch. Math. Log. 53(5-6): 519-524 (2014) - 2013
- [j62]Jesse Johnson, Julia F. Knight, V. Ocasio, S. VanDenDriessche:
An example related to Gregory's Theorem. Arch. Math. Log. 52(3-4): 419-434 (2013) - [j61]Jacob Carson, Jesse Johnson, Julia F. Knight, Karen M. Lange, Charles F. D. McCoy, John Wallbaum:
The Arithmetical Hierarchy in the Setting of ω1. Comput. 2(2): 93-105 (2013) - [j60]Uri Andrews, Julia F. Knight:
Spectra of atomic theories. J. Symb. Log. 78(4): 1189-1198 (2013) - [j59]Ekaterina B. Fokina, Sy-David Friedman, Julia F. Knight, Russell G. Miller:
Classes of structures with universe a subset of ω1. J. Log. Comput. 23(6): 1249-1265 (2013) - 2012
- [j58]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): 122-132 (2012) - [j57]Paola D'Aquino, Julia F. Knight, Sergei Starchenko:
Corrigendum to: "Real closed fields and models of arithmetic". J. Symb. Log. 77(2): 726 (2012) - 2011
- [j56]Paola D'Aquino, Julia F. Knight, Karen M. Lange:
Limit computable integer parts. Arch. Math. Log. 50(7-8): 681-695 (2011) - [j55]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): 846-869 (2011) - 2010
- [j54]Julia F. Knight, Jessica Millar:
Computable Structures of Rank. J. Math. Log. 10(1-2) (2010) - [j53]Paola D'Aquino, Julia F. Knight, Sergei Starchenko:
Real closed fields and models of Peano arithmetic. J. Symb. Log. 75(1): 1-11 (2010) - [j52]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): 85-96 (2010)
2000 – 2009
- 2009
- [j51]Wesley Calvert, Sergei S. Goncharov, Julia F. Knight, Jessica Millar:
Categoricity of computable infinitary theories. Arch. Math. Log. 48(1): 25-38 (2009) - [j50]Valentina S. Harizanov, Carl G. Jockusch Jr., Julia F. Knight:
Chains and antichains in partial orderings. Arch. Math. Log. 48(1): 39-53 (2009) - [j49]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): 1047-1060 (2009) - 2007
- [j48]Julia F. Knight, Sara Miller, Michael Vanden Boom:
Turing computable embeddings. J. Symb. Log. 72(3): 901-918 (2007) - [j47]John Chisholm, Julia F. Knight, Sara Miller:
Computable embeddings and strongly minimal theories. J. Symb. Log. 72(3): 1031-1040 (2007) - [j46]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): 1418-1432 (2007) - 2006
- [j45]Wesley Calvert, Julia F. Knight:
Classification from a Computable Viewpoint. Bull. Symb. Log. 12(2): 191-218 (2006) - [j44]Wesley Calvert, Julia F. Knight, Jessica Millar:
Computable trees of Scott rank ω1CK, and computable approximation. J. Symb. Log. 71(1): 283-298 (2006) - 2005
- [j43]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): 219-246 (2005) - 2004
- [j42]H. Jerome Keisler, Julia F. Knight:
Barwise: infinitary logic and admissible sets. Bull. Symb. Log. 10(1): 4-36 (2004) - [j41]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Richard A. Shore:
Pi11 relations and paths through. J. Symb. Log. 69(2): 585-611 (2004) - [j40]Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare:
Bounding prime models. J. Symb. Log. 69(4): 1117-1142 (2004) - 2003
- [j39]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): 279-291 (2003) - 2002
- [j38]Valentina S. Harizanov, Julia F. Knight, Andrei S. Morozov:
Sequences of n-Diagrams. J. Symb. Log. 67(3): 1227-1247 (2002) - 2001
- [j37]Julia F. Knight:
Minimality and Completions of PA. J. Symb. Log. 66(3): 1447-1457 (2001) - 2000
- [j36]Julia F. Knight, Michael Stob:
Computable Boolean Algebras. J. Symb. Log. 65(4): 1605-1623 (2000)
1990 – 1999
- 1998
- [j35]Julia F. Knight:
Coding a Family of Sets. Ann. Pure Appl. Log. 94(1-3): 127-142 (1998) - 1997
- [j34]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): 203-218 (1997) - [j33]Christopher J. Ash, Peter Cholak, Julia F. Knight:
Permitting, Forcing, and Copying of a Given Recursive Relation. Ann. Pure Appl. Log. 86(3): 219-236 (1997) - [j32]Christopher J. Ash, Julia F. Knight:
Possible Degrees in Recursive Copies II. Ann. Pure Appl. Log. 87(2): 151-165 (1997) - 1996
- [j31]Christopher J. Ash, Julia F. Knight:
Recursive Structures and Ershov's Hierarchy. Math. Log. Q. 42: 461-468 (1996) - [c1]Julia F. Knight, Brian Luense:
Control Theory, Modal Logic and Games. Hybrid Systems 1996: 160-173 - 1995
- [j30]Christopher J. Ash, Julia F. Knight:
Possible Degrees in Recursive Copies. Ann. Pure Appl. Log. 75(3): 215-221 (1995) - [j29]Julia F. Knight:
Requirement Systems. J. Symb. Log. 60(1): 222-245 (1995) - 1994
- [j28]Christopher J. Ash, Julia F. Knight:
Ramified Systems. Ann. Pure Appl. Log. 70(3): 205-221 (1994) - [j27]Julia F. Knight:
Nonarithmetical aleph0-Categorical Theories with Recursive Models. J. Symb. Log. 59(1): 106-112 (1994) - [j26]Christopher J. Ash, Julia F. Knight:
Mixed Systems. J. Symb. Log. 59(4): 1383-1399 (1994) - [j25]Christopher J. Ash, Julia F. Knight:
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas. Math. Log. Q. 40: 173-181 (1994) - 1990
- [j24]Christopher J. Ash, Julia F. Knight:
Pairs of Recursive Structures. Ann. Pure Appl. Log. 46(3): 211-234 (1990) - [j23]Julia F. Knight:
Constructions by Transfinitely Many Workers. Ann. Pure Appl. Log. 48(3): 237-259 (1990) - [j22]Julia F. Knight:
A Metatheorem for Constructions by Finitely Many Workers. J. Symb. Log. 55(2): 787-804 (1990)
1980 – 1989
- 1989
- [j21]Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman:
Generic Copies of Countable Structures. Ann. Pure Appl. Log. 42(3): 195-205 (1989) - 1988
- [j20]Julia F. Knight:
Meeting of the Association for Symbolic Logic: San Antonio, 1987. J. Symb. Log. 53(3): 1000-1006 (1988) - 1986
- [j19]Julia F. Knight:
Saturation of Homogeneous Resplendent Models. J. Symb. Log. 51(1): 222-224 (1986) - [j18]Julia F. Knight:
Degrees Coded in Jumps of Orderings. J. Symb. Log. 51(4): 1034-1042 (1986) - 1985
- [j17]John T. Baldwin, Matt Kaufmann, Julia F. Knight:
Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984. J. Symb. Log. 50(1): 284-286 (1985) - 1984
- [j16]Julia F. Knight, Alistair H. Lachlan, Robert I. Soare:
Two Theorems on Degrees of Models of True Arithmetic. J. Symb. Log. 49(2): 425-436 (1984) - 1983
- [j15]Robert E. Woodrow, Julia F. Knight:
A Complete Theory with Arbitrarily Large Minimality Ranks. J. Symb. Log. 48(2): 321-328 (1983) - [j14]Julia F. Knight:
Additive Structure in Uncountable Models for a Fixed Completion of P. J. Symb. Log. 48(3): 623-628 (1983) - [j13]Julia F. Knight:
Degrees of Types and Independent Sequences. J. Symb. Log. 48(4): 1074-1081 (1983) - 1982
- [j12]Julia F. Knight, Mark E. Nadel:
Expansions of Models and Turing Degrees. J. Symb. Log. 47(3): 587-604 (1982) - [j11]Julia F. Knight, Mark E. Nadel:
Models of Arithmetic and Closed Ideals. J. Symb. Log. 47(4): 833-840 (1982) - 1981
- [j10]Julia F. Knight:
Algebraic Independence. J. Symb. Log. 46(2): 377-384 (1981)
1970 – 1979
- 1978
- [j9]Julia F. Knight:
An Inelastic Model with Indiscernibles. J. Symb. Log. 43(2): 331-334 (1978) - [j8]Julia F. Knight:
Prime and Atomic Models. J. Symb. Log. 43(3): 385-393 (1978) - 1977
- [j7]Julia F. Knight:
A Complete L omega 1omega -Sentence Characterizing N1. J. Symb. Log. 42(1): 59-62 (1977) - [j6]Julia F. Knight:
Skolem Functions and Elementary Embeddings. J. Symb. Log. 42(1): 94-98 (1977) - 1976
- [j5]Julia F. Knight:
Omitting Types in Set Theory and Arithmetic. J. Symb. Log. 41(1): 25-32 (1976) - [j4]Julia F. Knight:
Hanf Numbers for Omitting Types Over Particular Theories. J. Symb. Log. 41(3): 583-588 (1976) - 1975
- [j3]Julia F. Knight:
Types Omitted in Uncountable Models of Arithmetic. J. Symb. Log. 40(3): 317-320 (1975) - 1973
- [j2]Julia F. Knight:
Complete Types and the Natural Numbers. J. Symb. Log. 38(3): 413-415 (1973) - [j1]Julia F. Knight:
Generic Expansions of Structures. J. Symb. Log. 38(4): 561-570 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
