The following pages link to Julia F. Knight (Q494651):
Displayed 50 items.
- (Q403396) (redirect page) (← links)
- Index sets and Scott sentences (Q403398) (← links)
- Representing Scott sets in algebraic settings (Q494652) (← links)
- (Q647340) (redirect page) (← links)
- Limit computable integer parts (Q647341) (← links)
- The computable embedding problem (Q695798) (← links)
- Preserving categoricity and complexity of relations (Q887644) (← links)
- Pairs of recursive structures (Q923075) (← links)
- Constructions by transfinitely many workers (Q923078) (← links)
- Decidability and computability of certain torsion-free abelian groups (Q976537) (← links)
- Chains and antichains in partial orderings (Q1005926) (← links)
- Categoricity of computable infinitary theories (Q1005932) (← links)
- Generic copies of countable structures (Q1123889) (← links)
- Theories whose resplendent models are homogeneous (Q1170182) (← links)
- Coding a family of sets (Q1295408) (← links)
- Ramified systems (Q1344627) (← links)
- Quasi-simple relations in copies of a given recursive structure (Q1365244) (← links)
- Permitting, forcing, and copying of a given recursive relation (Q1365246) (← links)
- Possible degrees in recursive copies. II (Q1368584) (← links)
- Simple and immune relations on countable structures (Q1407593) (← links)
- Computable structures and the hyperarithmetical hierarchy (Q1572657) (← links)
- Strongly minimal theories with recursive models (Q1644487) (← links)
- Lengths of developments in \(K((G))\) (Q1726002) (← links)
- Scott sentences for certain groups (Q1745362) (← links)
- Hanf number for Scott sentences of computable structures (Q1756497) (← links)
- Possible degrees in recursive copies (Q1902615) (← links)
- Lengths of roots of polynomials in a Hahn field (Q2246819) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Erratum to: ``Limit computable integer parts'' (Q2339967) (← links)
- An example related to Gregory's theorem (Q2377350) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Computable Boolean algebras (Q2710598) (← links)
- Minimality and completions of <i>PA</i> (Q2758069) (← links)
- Describing free groups (Q2844726) (← links)
- Corrigendum to: “Real closed fields and models of arithmetic” (Q2892688) (← links)
- COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS (Q2976365) (← links)
- COMPARING TWO VERSIONS OF THE REALS (Q2976382) (← links)
- (Q3032236) (← links)
- Expansions of models and turing degrees (Q3043119) (← links)
- (Q3068266) (← links)
- (Q3093863) (← links)
- COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ (Q3094353) (← links)
- Real closed exponential fields (Q3168567) (← links)
- Classes of Ulm type and coding rank-homogeneous trees in other structures (Q3173529) (← links)
- Well Quasi-orderings and Roots of Polynomials in a Hahn Field (Q3295148) (← links)
- A complete theory with arbitrarily large minimality ranks (Q3323929) (← links)
- Degrees of types and independent sequences (Q3328526) (← links)
- Additive structure in uncountable models for a fixed completion of <i>P</i> (Q3342546) (← links)
- Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
- Classification from a Computable Viewpoint (Q3430937) (← links)