In this paper we present BTC, which is a complete logic for branchingtime whose modal operator quantifies over histories and whose temporal operators involve a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL express an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as for instance Stit Logics. © 2010 Springer Science+Business Media B.V.
Ciuni, R., Zanardo, A. (2010). Completeness of a Branching-Time Logic with Possible Choices. STUDIA LOGICA, 96(3), 393-420 [10.1007/s11225-010-9291-1].
Completeness of a Branching-Time Logic with Possible Choices
Ciuni R.;
2010-01-01
Abstract
In this paper we present BTC, which is a complete logic for branchingtime whose modal operator quantifies over histories and whose temporal operators involve a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL express an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as for instance Stit Logics. © 2010 Springer Science+Business Media B.V.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
