2 citations · 5 across the 8 of their papers we have counts for
12 papers
Free structures and limiting density
Johanna N. Y. Franklin, Meng-Che "Turbo" Ho, Julia Knight
Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated…
Strong Jump Inversion
W. Calvert, A. Frolov, V. Harizanov +4
We say that a structure admits \emph{strong jump inversion} provided that for every oracle , if computes for some $\mathcal{C}\cong\mathcal{…
Some new computable structures of high rank
Matthew Harrison-Trainor, Gregory Igusa, Julia F. Knight
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank , the computable infinitary theory is $\al…
Scott sentences for certain groups
Julia Knight, Vikram Saraph
We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finite…
Hanf Number for Scott Sentences of Computable Structures
Sergey Goncharov, Julia Knight, Ioannis Souldatos
The Hanf number for a set of sentences in (or some other logic) is the least infinite cardinal such that for all , if has models in all infinite car…
Representing Scott sets in algebraic settings
Alf Dolich, Julia Knight, Karen Lange +1
We prove that for every Scott set there are -saturated real closed fields and models of Presburger arithmetic.