 A different approach to actions in deontic logic originates in Segerberg 1982, and further developed inter alia in Kulicki and Trypuz 2017. Here, a Boolean algebra of actions is proposed—analogous to the Boolean algebra of PC—and one defines functions that specify which (basic and complex) actions are permissible, forbidden, or required. An expression like “\(P \alpha\)” then just means that \(\alpha\) is a member of the set of permitted actions, and such expressions are used to build more complex ones using classical propositional connectives. Whereas in dynamic deontic logic, the deontic behavior of complex actions is governed by the underlying logic of actions (i.e., PDL), in deontic logics over Boolean action algebras, specific frame conditions are imposed to ensure that, e.g., “action \(\alpha\) is forbidden” entails that “doing \(\alpha\) and \(\beta\) (say, simultaneously) is  forbidden”.[84]