The Finite Values Property
Elizabeth A. Howarth, Jeffrey Bruce Paris · MIMS EPrints (University of Southampton) · 2016
We argue that the simplicity condition on a probability function on sentences of a predicate language $L$ that it takes only finitely many values on the sentences of any finite sublanguage of $L$ can be viewed as rational. We then go on to investigate consequences of this condition, linking it to the model theoretic notion of quantifier elimination.