2 citations · 6 across the 20 of their papers we have counts for
4 papers · 1 filter
Characterizations of Cancellable Groups
Matthew Harrison-Trainor, Meng-Che "Turbo" Ho
An abelian group is said to be cancellable if whenever is isomorphic to , is isomorphic to . We show that the index set of cancellable rank 1 to…
Which Classes of Structures Are Both Pseudo-elementary and Definable by an Infinitary Sentence?
Will Boney, Barbara F. Csima, Nancy A. Day +1
When classes of structures are not first-order definable, we might still try to find a nice description. There are two common ways for doing this. One is to expand the language, le…
Optimal bounds for single-source Kolmogorov extractors
Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
The rate of randomness (or dimension) of a string is the ratio where is the Kolmogorov complexity of . While it is known that a single computable transform…
Degrees of Categoricity Above Limit Ordinals
Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor +1
A computable structure has degree of categoricity if is exactly the degree of difficulty of computing isomorphisms between isomorphic comput…