We consider a quantifier-free language in which there are terms as well as formulas. The proposition-forming propositional operators are the usual ones, and the term-making term operators are the usual lattice theoretical ones. In addition there is a formula-making term operator, does. We study a new logic in which does is claimed to approximate some features of the informal concept the agent performs the action.

The formal language studied in this paper contains two categories of expressions, terms and formulas. Terms express events, formulas propositions. There are infinitely many atomic terms and complex terms are made up by Boolean operations. Where and are terms the atomic formulas have the form = ( is the same as ), Forb ( is forbidden) and Perm ( is permitted). The formulae are truth functional combinations of these. An algebraic and a model theoretic account of validity are given and (...) an axiomatic system is provided for which they are characteristic.The closure principle, that what is not forbidden is permitted is shown to hold at the level of outcomes but not at the level of events. In the two final sections some other operators are considered and a semantics in terms of action games. (shrink)