Universal Skolem sorts for randomizations
Abstract
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.
Domains
Logic [math.LO]
Origin : Files produced by the author(s)