Universal Skolem sorts for randomizations
Jorge Muñoz Carvajal · HAL (Le Centre pour la Communication Scientifique Directe) · 2022
We show that if a complete theory T in a countable language admits a universal Skolem sort, then its randomization T^R also admits such a sort. We also describe the groupoid associated to the randomization in terms of the groupoid associated to the original theory.