  We define and study logics in the framework of probabilistic team semantics
and over metafinite structures. Our work is paralleled by the recent
development of novel axiomatizable and tractable logics in team semantics that
are closed under the Boolean negation. Our logics employ new probabilistic
atoms that resemble so-called extended atoms from the team semantics
literature. We also define counterparts of our logics over metafinite
structures and show that all of our logics can be translated into functional
fixed point logic implying a polynomial time upper bound for data complexity
with respect to BSS-computations.
