×

zbMATH — the first resource for mathematics

Completeness theorem for a monadic logic with both first-order and probability quantifiers. (English) Zbl 0717.03016
Summary: We prove a completeness theorem for a logic with both probability and first-order quantifiers in the case when the basic language contains only unary relation symbols.
MSC:
03C80 Logic with extra quantifiers and operators
PDF BibTeX XML Cite
Full Text: EuDML