4 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
Almost free algebras: from the word problem to elimination of quantifiers
Yifan Jia, Heer Tern Koh, Bakh Khoussainov
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term eq…
Primitive recursive categoricity spectra of functional structures
Nikolay Bazhenov, Heer Tern Koh, Keng Meng Ng
For the notion of degree of categoricity, we study an analogous notion for punctual structures. We show that such notions coincide for non--categorical injection structu…
Primitive recursive categoricity spectra
Nikolay Bazhenov, Heer Tern Koh, Keng Meng Ng
We study the primitive recursive analogue of computable categoricity spectra for various natural classes of structures. We show that these notions coincide for all relatively $Δ_{2…
Computable topological groups
Heer Tern Koh, Alexander Melnikov, Keng Meng Ng
We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these not…