 This language is interpreted on very simple first-order models, which are triples \(M=(D,I,P)\), where the domain of discourse \(D\) is a finite nonempty set of objects, the interpretation \(I\) associates an \(n\)-ary function on \(D\) with every \(n\)-ary function symbol occurring in the language, and an \(n\)-ary relation on \(D\) with every \(n\)-ary predicate letter. \(P\) is a probability function that assigns a probability \(P(d)\) to every element \(d\) in \(D\) such that \(\sum_{d \in D} P(d)=1\).