  We study the first-order primal infon logic. It is the core of the policy
language DKAL. We provide Gentzen-style calculi for two versions of this logic
that are not equivalent. For both versions we investigate the semantics: one of
them is a generalization of the so-called quasi-boolean semantics, the other
one is a Krypke-style semantics. We prove the completeness results and the
disjunction property for both logics.
