| 2005 |
|---|
| 42 | EE | Sergei S. Goncharov,
Valentina S. Harizanov,
Julia F. Knight,
Charles F. D. McCoy,
Russell Miller,
Reed Solomon:
Enumerations in computable structure theory.
Ann. Pure Appl. Logic 136(3): 219-246 (2005) |
| 2004 |
|---|
| 41 | EE | H. Jerome Keisler,
Julia F. Knight:
Barwise: infinitary logic and admissible sets.
Bulletin of Symbolic Logic 10(1): 4-36 (2004) |
| 2003 |
|---|
| 40 | EE | 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 |
|---|
| 39 | | Valentina S. Harizanov,
Julia F. Knight,
Andrei S. Morozov:
Sequences of n-Diagrams.
J. Symb. Log. 67(3): 1227-1247 (2002) |
| 2001 |
|---|
| 38 | | Julia F. Knight:
Minimality and Completions of PA.
J. Symb. Log. 66(3): 1447-1457 (2001) |
| 2000 |
|---|
| 37 | | Julia F. Knight,
Michael Stob:
Computable Boolean Algebras.
J. Symb. Log. 65(4): 1605-1623 (2000) |
| 1998 |
|---|
| 36 | | Julia F. Knight:
Coding a Family of Sets.
Ann. Pure Appl. Logic 94(1-3): 127-142 (1998) |
| 1997 |
|---|
| 35 | | Christopher J. Ash,
Julia F. Knight,
Jeffrey B. Remmel:
Quasi-Simple Relations in Copies of a Given Recursive Structure.
Ann. Pure Appl. Logic 86(3): 203-218 (1997) |
| 34 | | Christopher J. Ash,
Peter Cholak,
Julia F. Knight:
Permitting, Forcing, and Copying of a Given Recursive Relation.
Ann. Pure Appl. Logic 86(3): 219-236 (1997) |
| 33 | | Christopher J. Ash,
Julia F. Knight:
Possible Degrees in Recursive Copies II.
Ann. Pure Appl. Logic 87(2): 151-165 (1997) |
| 1996 |
|---|
| 32 | | Julia F. Knight,
Brian Luense:
Control Theory, Modal Logic and Games.
Hybrid Systems 1996: 160-173 |
| 31 | | Christopher J. Ash,
Julia F. Knight:
Recursive Structures and Ershov's Hierarchy.
Math. Log. Q. 42: 461-468 (1996) |
| 1995 |
|---|
| 30 | | Christopher J. Ash,
Julia F. Knight:
Possible Degrees in Recursive Copies.
Ann. Pure Appl. Logic 75(3): 215-221 (1995) |
| 29 | | Julia F. Knight:
Requirement Systems.
J. Symb. Log. 60(1): 222-245 (1995) |
| 1994 |
|---|
| 28 | | Christopher J. Ash,
Julia F. Knight:
Ramified Systems.
Ann. Pure Appl. Logic 70(3): 205-221 (1994) |
| 27 | | Julia F. Knight:
Nonarithmetical aleph0-Categorical Theories with Recursive Models.
J. Symb. Log. 59(1): 106-112 (1994) |
| 26 | | Christopher J. Ash,
Julia F. Knight:
Mixed Systems.
J. Symb. Log. 59(4): 1383-1399 (1994) |
| 25 | | Christopher J. Ash,
Julia F. Knight:
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas.
Math. Log. Q. 40: 173-181 (1994) |
| 1990 |
|---|
| 24 | | Christopher J. Ash,
Julia F. Knight:
Pairs of Recursive Structures.
Ann. Pure Appl. Logic 46(3): 211-234 (1990) |
| 23 | | Julia F. Knight:
Constructions by Transfinitely Many Workers.
Ann. Pure Appl. Logic 48(3): 237-259 (1990) |
| 22 | | Julia F. Knight:
A Metatheorem for Constructions by Finitely Many Workers.
J. Symb. Log. 55(2): 787-804 (1990) |
| 1989 |
|---|
| 21 | | Christopher J. Ash,
Julia F. Knight,
Mark S. Manasse,
Theodore A. Slaman:
Generic Copies of Countable Structures.
Ann. Pure Appl. Logic 42(3): 195-205 (1989) |
| 1988 |
|---|
| 20 | | Julia F. Knight:
Meeting of the Association for Symbolic Logic: San Antonio, 1987.
J. Symb. Log. 53(3): 1000-1006 (1988) |
| 1986 |
|---|
| 19 | | Julia F. Knight:
Saturation of Homogeneous Resplendent Models.
J. Symb. Log. 51(1): 222-224 (1986) |
| 18 | | Julia F. Knight:
Degrees Coded in Jumps of Orderings.
J. Symb. Log. 51(4): 1034-1042 (1986) |
| 1985 |
|---|
| 17 | | 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 |
|---|
| 16 | | 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 |
|---|
| 15 | | Robert E. Woodrow,
Julia F. Knight:
A Complete Theory with Arbitrarily Large Minimality Ranks.
J. Symb. Log. 48(2): 321-328 (1983) |
| 14 | | Julia F. Knight:
Additive Structure in Uncountable Models for a Fixed Completion of P.
J. Symb. Log. 48(3): 623-628 (1983) |
| 13 | | Julia F. Knight:
Degrees of Types and Independent Sequences.
J. Symb. Log. 48(4): 1074-1081 (1983) |
| 1982 |
|---|
| 12 | | Julia F. Knight,
Mark E. Nadel:
Expansions of Models and Turing Degrees.
J. Symb. Log. 47(3): 587-604 (1982) |
| 11 | | Julia F. Knight,
Mark E. Nadel:
Models of Arithmetic and Closed Ideals.
J. Symb. Log. 47(4): 833-840 (1982) |
| 1981 |
|---|
| 10 | | Julia F. Knight:
Algebraic Independence.
J. Symb. Log. 46(2): 377-384 (1981) |
| 1978 |
|---|
| 9 | | Julia F. Knight:
An Inelastic Model with Indiscernibles.
J. Symb. Log. 43(2): 331-334 (1978) |
| 8 | | Julia F. Knight:
Prime and Atomic Models.
J. Symb. Log. 43(3): 385-393 (1978) |
| 1977 |
|---|
| 7 | | Julia F. Knight:
A Complete L omega 1omega -Sentence Characterizing N1.
J. Symb. Log. 42(1): 59-62 (1977) |
| 6 | | Julia F. Knight:
Skolem Functions and Elementary Embeddings.
J. Symb. Log. 42(1): 94-98 (1977) |
| 1976 |
|---|
| 5 | | Julia F. Knight:
Omitting Types in Set Theory and Arithmetic.
J. Symb. Log. 41(1): 25-32 (1976) |
| 4 | | Julia F. Knight:
Hanf Numbers for Omitting Types Over Particular Theories.
J. Symb. Log. 41(3): 583-588 (1976) |
| 1975 |
|---|
| 3 | | Julia F. Knight:
Types Omitted in Uncountable Models of Arithmetic.
J. Symb. Log. 40(3): 317-320 (1975) |
| 1973 |
|---|
| 2 | | Julia F. Knight:
Complete Types and the Natural Numbers.
J. Symb. Log. 38(3): 413-415 (1973) |
| 1 | | Julia F. Knight:
Generic Expansions of Structures.
J. Symb. Log. 38(4): 561-570 (1973) |
