2000 character limit reached
Cut-free Calculi and Relational Semantics for Temporal STIT Logics (1904.09899v1)
Published 22 Apr 2019 in cs.LO, cs.AI, and math.LO
Abstract: We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm, Tstit and Xstit. All calculi presented possess essential structural properties such as contraction- and cut-admissibility. The labelled calculi G3Ldm and G3TSTIT are shown sound and complete relative to irreflexive temporal frames. Additionally, we extend current results by showing that also XSTIT can be characterized through relational frames, omitting the use of BT+AC frames.