2 papers
math.LO2024
Scott Complexity of Reduced Abelian -Groups
Rachael Alvir, Barbara F. Csima, Luke MacLean
Given a reduced abelian -group, we give an upper bound on the Scott complexity of the group in terms of its Ulm invariants. For limit ordinals, we show that this upper bound is…
math.LO2022
Relations enumerable from positive information
Barbara F. Csima, Luke MacLean, Dino Rossegger
We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to…