PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.) Vol. 65(79), pp. 816 (1999) 

Weak probability logic with infinitary predicatesS. Marinkovi\'c, M. Ra\v skovi\'c and R. Djordjevi\'cPrirodnomatemati\v cki fakultet, Kragujevac, YugoslaviaAbstract: 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. Classification (MSC2000): 03C70 Full text of the article:
Electronic fulltext finalized on: 1 Nov 2001. This page was last modified: 7 Dec 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
