Weak Probability Logic With Infinitary Predicates


S. Marinković, M. Rašković, R. Đorđević


We construct the logic $L(V,\nu,\frak{m},R)$, as a logic with infinitary predicates, generalized ordinary and probability quantifiers and propositional connectives. An important feature of this logic is that infinitely many variables can occur in a single formula, but only finitely many quantifiers and connectives. We prove the weak completeness theorem for this logic.