Axioms for Deliberative STIT

    loading  Checking for direct PDF access through Ovid



Based on a notion of “companions to stit formulas” applied in other papers dealing with astit logics, we introduce “choice formulas” and “nested choice formulas” to prove the completeness theorems for dstit logics in a language with the dstit operator as the only non-truth-functional operator. The main logic discussed in this paper is the basic logic of dstit with multiple agents, other logics discussed include the basic logic of dstit with a single agent and some logics of dstit with multiple agents each of which corresponds to a semantic condition concerning the number of possible choices for agents.

Related Topics

    loading  Loading Related Articles