Julia F. Knight

From MaRDI portal
Person:494651

Available identifiers

zbMath Open knight.julia-fMaRDI QIDQ494651

List of research outcomes

PublicationDate of PublicationType
Classes of algebraic structures2024-02-01Paper
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER2023-09-11Paper
Free structures and limiting density2022-09-08Paper
COPYING ONE OF A PAIR OF STRUCTURES2022-08-29Paper
INTERPRETING A FIELD IN ITS HEISENBERG GROUP2022-08-29Paper
Lengths of roots of polynomials in a Hahn field2021-11-16Paper
CODING IN GRAPHS AND LINEAR ORDERINGS2021-01-29Paper
Complexity of Scott sentences2021-01-25Paper
Well Quasi-orderings and Roots of Polynomials in a Hahn Field2020-07-08Paper
Interpreting a field in its Heisenberg group2020-06-21Paper
Lengths of developments in \(K((G))\)2019-02-15Paper
Hanf number for Scott sentences of computable structures2019-01-14Paper
UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES2018-08-10Paper
Strongly minimal theories with recursive models2018-06-21Paper
Some new computable structures of high rank2018-04-20Paper
Scott sentences for certain groups2018-04-17Paper
COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS2017-06-01Paper
COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS2017-04-28Paper
COMPARING TWO VERSIONS OF THE REALS2017-04-28Paper
Scott sentences for certain groups2016-06-20Paper
Hanf Number for Scott Sentences of Computable Structures2016-02-02Paper
https://portal.mardi4nfdi.de/entity/Q34646572016-01-27Paper
Preserving categoricity and complexity of relations2015-10-27Paper
Representing Scott sets in algebraic settings2015-09-01Paper
Erratum to: ``Limit computable integer parts2015-04-14Paper
Using computability to measure complexity of algebraic structures and classes of structures2015-03-17Paper
Index sets and Scott sentences2014-08-29Paper
The Arithmetical Hierarchy in the Setting of $\omega_1$2014-04-30Paper
Spectra of Atomic Theories2014-04-04Paper
Classes of structures with universe a subset of  12014-04-01Paper
Describing free groups2013-08-19Paper
Complexity of structures associated with real closed fields2013-08-05Paper
An example related to Gregory's theorem2013-06-28Paper
The computable embedding problem2012-12-17Paper
Real closed exponential fields2012-10-31Paper
Corrigendum to: “Real closed fields and models of arithmetic”2012-06-19Paper
Isomorphism relations on computable structures2012-04-19Paper
Limit computable integer parts2011-11-23Paper
COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$2011-10-24Paper
https://portal.mardi4nfdi.de/entity/Q30938632011-10-19Paper
Classes of Ulm type and coding rank-homogeneous trees in other structures2011-10-10Paper
https://portal.mardi4nfdi.de/entity/Q30682662011-01-13Paper
Decidability and computability of certain torsion-free abelian groups2010-06-11Paper
Real closed fields and models of Peano arithmetic2010-03-15Paper
Intrinsic bounds on complexity and definability at limit levels2009-09-29Paper
Chains and antichains in partial orderings2009-03-17Paper
Categoricity of computable infinitary theories2009-03-17Paper
https://portal.mardi4nfdi.de/entity/Q35494682008-12-28Paper
Index sets of computable structures2008-12-18Paper
Structures in Familiar Classes Which Have Scott Rank $\omega_1^{CK}$2008-03-22Paper
Index sets for classes of high rank structures2008-02-25Paper
Computable embeddings and strongly minimal theories2007-10-17Paper
https://portal.mardi4nfdi.de/entity/Q52956972007-07-30Paper
Relatively Hyperimmune Relations on Structures2007-07-26Paper
Strong initial segments of models of IΔ02007-07-26Paper
Classification from a Computable Viewpoint2007-04-05Paper
Comparing Classes of Finite Structures2006-07-18Paper
Computable trees of Scott rank ω1CK, and computable approximation2006-07-05Paper
https://portal.mardi4nfdi.de/entity/Q57118902005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q57026672005-11-02Paper
Enumerations in computable structure theory2005-10-26Paper
Π11 relations and paths through2005-08-29Paper
Bounding prime models2005-08-29Paper
Barwise: Infinitary Logic and Admissible Sets2005-05-24Paper
https://portal.mardi4nfdi.de/entity/Q46567992005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44516332004-02-29Paper
Simple and immune relations on countable structures2003-09-16Paper
Minimality and completions of PA2002-07-14Paper
Sequences of n-diagrams2002-01-01Paper
Computable Boolean algebras2001-07-16Paper
https://portal.mardi4nfdi.de/entity/Q45139712001-06-18Paper
https://portal.mardi4nfdi.de/entity/Q49385592000-08-15Paper
Computable structures and the hyperarithmetical hierarchy2000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q42493622000-03-29Paper
Coding a family of sets1999-11-08Paper
Possible degrees in recursive copies. II1997-12-08Paper
Quasi-simple relations in copies of a given recursive structure1997-10-14Paper
Permitting, forcing, and copying of a given recursive relation1997-10-14Paper
Recursive Structures and Ershov's Hierarchy1997-05-27Paper
https://portal.mardi4nfdi.de/entity/Q56897391997-01-07Paper
Possible degrees in recursive copies1996-05-13Paper
In Memoriam: Christopher John Ash1995-09-20Paper
Ramified systems1995-08-27Paper
Mixed systems1995-08-27Paper
Requirement systems1995-07-03Paper
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas1995-04-20Paper
https://portal.mardi4nfdi.de/entity/Q43147951995-04-03Paper
Relatively recursive expansions1995-03-29Paper
Nonarithmetical ℵ0-categorical theories with recursive models1995-01-22Paper
Recursive expansions1994-11-10Paper
Orderings with αth Jump Degree 0 (α)1992-06-28Paper
Decidability for a temporal logic used in discrete-event system analysis1990-01-01Paper
Pairs of recursive structures1990-01-01Paper
Constructions by transfinitely many workers1990-01-01Paper
Jumps of Orderings1990-01-01Paper
A metatheorem for constructions by finitely many workers1990-01-01Paper
Generic copies of countable structures1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30322361987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37738551987-01-01Paper
Saturation of homogeneous resplendent models1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37622991986-01-01Paper
Degrees coded in jumps of orderings1986-01-01Paper
Definable Sets in Ordered Structures. II1986-01-01Paper
Two theorems on degrees of models of true arithmetic1984-01-01Paper
A complete theory with arbitrarily large minimality ranks1983-01-01Paper
Degrees of types and independent sequences1983-01-01Paper
Additive structure in uncountable models for a fixed completion of P1983-01-01Paper
Theories whose resplendent models are homogeneous1982-01-01Paper
Expansions of models and turing degrees1982-01-01Paper
Models of arithmetic and closed ideals1982-01-01Paper
Algebraic independence1981-01-01Paper
An inelastic model with indiscernibles1978-01-01Paper
Prime and atomic models1978-01-01Paper
A complete Lω1ω-sentence characterizing ℵ11977-01-01Paper
Skolem functions and elementary embeddings1977-01-01Paper
Omitting types in set theory and arithmetic1976-01-01Paper
Hanf numbers for omitting types over particular theories1976-01-01Paper
Types omitted in uncountable models of arithmetic1975-01-01Paper
Generic expansions of structures1974-01-01Paper
Complete types and the natural numbers1973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Julia F. Knight