Search the dblp DataBase
Julia F. Knight :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Julia F. Knight , Brian Luense Control Theory, Modal Logic and Games. [Citation Graph (0, 0)][DBLP ] Hybrid Systems, 1996, pp:160-173 [Conf ] Sergei S. Goncharov , Valentina S. Harizanov , Julia F. Knight , Charles F. D. McCoy Simple and immune relations on countable structures. [Citation Graph (0, 0)][DBLP ] Arch. Math. Log., 2003, v:42, n:3, pp:279-291 [Journal ] Christopher J. Ash , Julia F. Knight Possible Degrees in Recursive Copies II. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1997, v:87, n:2, pp:151-165 [Journal ] Christopher J. Ash , Julia F. Knight , Jeffrey B. Remmel Quasi-Simple Relations in Copies of a Given Recursive Structure. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1997, v:86, n:3, pp:203-218 [Journal ] Christopher J. Ash , Julia F. Knight , Mark S. Manasse , Theodore A. Slaman Generic Copies of Countable Structures. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1989, v:42, n:3, pp:195-205 [Journal ] Christopher J. Ash , Peter Cholak , Julia F. Knight Permitting, Forcing, and Copying of a Given Recursive Relation. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1997, v:86, n:3, pp:219-236 [Journal ] Christopher J. Ash , Julia F. Knight Pairs of Recursive Structures. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1990, v:46, n:3, pp:211-234 [Journal ] Christopher J. Ash , Julia F. Knight Ramified Systems. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1994, v:70, n:3, pp:205-221 [Journal ] Christopher J. Ash , Julia F. Knight Possible Degrees in Recursive Copies. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1995, v:75, n:3, pp:215-221 [Journal ] Sergei S. Goncharov , Valentina S. Harizanov , Julia F. Knight , Charles F. D. McCoy , Russell Miller , Reed Solomon Enumerations in computable structure theory. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2005, v:136, n:3, pp:219-246 [Journal ] Julia F. Knight Constructions by Transfinitely Many Workers. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1990, v:48, n:3, pp:237-259 [Journal ] Julia F. Knight Coding a Family of Sets. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:127-142 [Journal ] H. Jerome Keisler , Julia F. Knight Barwise: infinitary logic and admissible sets. [Citation Graph (0, 0)][DBLP ] Bulletin of Symbolic Logic, 2004, v:10, n:1, pp:4-36 [Journal ] Christopher J. Ash , Julia F. Knight Mixed Systems. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1994, v:59, n:4, pp:1383-1399 [Journal ] John T. Baldwin , Matt Kaufmann , Julia F. Knight Meeting of the Association for Symbolic Logic: Notre Dame, Indiana, 1984. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1985, v:50, n:1, pp:284-286 [Journal ] Valentina S. Harizanov , Julia F. Knight , Andrei S. Morozov Sequences of n-Diagrams. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2002, v:67, n:3, pp:1227-1247 [Journal ] Julia F. Knight A Metatheorem for Constructions by Finitely Many Workers. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1990, v:55, n:2, pp:787-804 [Journal ] Julia F. Knight Nonarithmetical aleph0 -Categorical Theories with Recursive Models. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1994, v:59, n:1, pp:106-112 [Journal ] Julia F. Knight Requirement Systems. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1995, v:60, n:1, pp:222-245 [Journal ] Julia F. Knight , Alistair H. Lachlan , Robert I. Soare Two Theorems on Degrees of Models of True Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1984, v:49, n:2, pp:425-436 [Journal ] Julia F. Knight , Mark E. Nadel Expansions of Models and Turing Degrees. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1982, v:47, n:3, pp:587-604 [Journal ] Julia F. Knight , Mark E. Nadel Models of Arithmetic and Closed Ideals. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1982, v:47, n:4, pp:833-840 [Journal ] Julia F. Knight , Michael Stob Computable Boolean Algebras. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2000, v:65, n:4, pp:1605-1623 [Journal ] Julia F. Knight Minimality and Completions of PA. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2001, v:66, n:3, pp:1447-1457 [Journal ] Julia F. Knight Complete Types and the Natural Numbers. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1973, v:38, n:3, pp:413-415 [Journal ] Julia F. Knight Generic Expansions of Structures. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1973, v:38, n:4, pp:561-570 [Journal ] Julia F. Knight Types Omitted in Uncountable Models of Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1975, v:40, n:3, pp:317-320 [Journal ] Julia F. Knight Omitting Types in Set Theory and Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:1, pp:25-32 [Journal ] Julia F. Knight Hanf Numbers for Omitting Types Over Particular Theories. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:3, pp:583-588 [Journal ] Julia F. Knight A Complete L omega 1omega -Sentence Characterizing N1 . [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1977, v:42, n:1, pp:59-62 [Journal ] Julia F. Knight Skolem Functions and Elementary Embeddings. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1977, v:42, n:1, pp:94-98 [Journal ] Julia F. Knight An Inelastic Model with Indiscernibles. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1978, v:43, n:2, pp:331-334 [Journal ] Julia F. Knight Prime and Atomic Models. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1978, v:43, n:3, pp:385-393 [Journal ] Julia F. Knight Algebraic Independence. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1981, v:46, n:2, pp:377-384 [Journal ] Julia F. Knight Additive Structure in Uncountable Models for a Fixed Completion of P. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1983, v:48, n:3, pp:623-628 [Journal ] Julia F. Knight Degrees of Types and Independent Sequences. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1983, v:48, n:4, pp:1074-1081 [Journal ] Julia F. Knight Saturation of Homogeneous Resplendent Models. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1986, v:51, n:1, pp:222-224 [Journal ] Julia F. Knight Degrees Coded in Jumps of Orderings. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1986, v:51, n:4, pp:1034-1042 [Journal ] Julia F. Knight Meeting of the Association for Symbolic Logic: San Antonio, 1987. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1988, v:53, n:3, pp:1000-1006 [Journal ] Robert E. Woodrow , Julia F. Knight A Complete Theory with Arbitrarily Large Minimality Ranks. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1983, v:48, n:2, pp:321-328 [Journal ] Christopher J. Ash , Julia F. Knight A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 1994, v:40, n:, pp:173-181 [Journal ] Christopher J. Ash , Julia F. Knight Recursive Structures and Ershov's Hierarchy. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 1996, v:42, n:, pp:461-468 [Journal ] Categoricity of computable infinitary theories. [Citation Graph (, )][DBLP ] Chains and antichains in partial orderings. [Citation Graph (, )][DBLP ] Classification from a Computable Viewpoint. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs