Busy choice sequences refraining formulas and modalities
If one thinks of the operator `stit' in stit theory [see \textit{N. Belnap} and \textit{M. Perloff}, ``Seeing to it that: a canonical form for agentives, in H. E. Kyburg jun., R. P. Loui and G. N. Carlson (eds.), Knowledge representation and defeasible reasoning, 169-190 (1990; Zbl 0743.68024)] as a modal operator, we may ask how many distinct modalities there are. The answer depends on the complexity of busy choice sequences (sequences of infinitely many non-vacuous choices made in a finite time) allowed in models. The paper defines a degree of complexity on chains of busy choice sequences, and hence on models, and proves that for all \(n\geq 0\), if the models are those of complexity \(\leq n\) then there are exactly \(4n+ 10\) distinct modalities, each of length \(\leq n+ 2\).
- Decidability of stit theory with a single agent and Refref equivalence
- Doing and refraining from refraining
- Getting started: Beginnings in the logic of action
- scientific article; zbMATH DE number 1028832 (Why is no real title available?)
- In the realm of agents
- Modal Logics Between S 4 and S 5
- Modalities in the Survey system of strict implication
- The way of the agent
- Time and modality in the logic of agency
This page was built for publication: Busy choice sequences refraining formulas and modalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893121)
