2 papers
math.LO2016
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…
math.LO2015
Computable Ramsey's Theorem for Pairs Needs Infinitely Many Pi-0-2 Sets
Gregory Igusa, Henry Towsner
In \cite{J}, Theorem 4.2, Jockusch proves that for any computable k-coloring of pairs of integers, there is an infinite homogeneous set. The proof uses a countable collecti…