Universal Skolem sorts for randomizations
Résumé
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.
Domaines
Logique [math.LO]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|