A countable structure has a decidable presentation exactly when its Borel randomization has an aware computable presentation, and effectively ω-categorical structures have computably categorical randomizations.
Ben Yaacov, On theories of random variables, Israel J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.LO 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Computable presentations of randomizations
A countable structure has a decidable presentation exactly when its Borel randomization has an aware computable presentation, and effectively ω-categorical structures have computably categorical randomizations.