4 papers · 1 filter
Scott analysis, linear orders and almost periodic functions
David Gonzalez, Matthew Harrison-Trainor, Meng-Che "Turbo" Ho
For any limit ordinal , we construct a linear order whose Scott complexity is . This completes the classification of the possible Scott sentence complexities of l…
Torsion-free abelian groups of finite rank and fields of finite transcendence degree
Meng-Che "Turbo" Ho, Julia Knight, Russell Miller
Let be the class of torsion-free abelian groups of rank , and let be the class of fields of characteristic and transcendence de…
Two results on complexities of decision problems of groups
Uri Andrews, Matthew Harrison-Trainor, Meng-Che "Turbo" Ho
We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism pro…
Algorithmically finite, universal, and -universal groups
Uri Andrews, Meng-Che "Turbo" Ho
The study of the word problems of groups dates back to Dehn in 1911, and has been a central topic of study in both group theory and computability theory. As most naturally occurrin…