We propose an approach for defining labeled natural deduction systems for the class of Peircean branching temporal logics, seen as logics in their own right rather than as sub logics of Ockhamist systems. In particular, we give a system for the logic UB, i.e., the until-free fragment of CTL, and show that it is sound and complete. We also study normalization and discuss how derivations may reduce to a normal form using an appropriate management of proof contexts. Finally, we briefly discuss how to extend our system in order to capture full CTL.
Id prodotto:
82013
Handle IRIS:
11562/747769
depositato il:
26 giugno 2014
ultima modifica:
9 novembre 2022
Citazione bibliografica:
C., Caleiro; Vigano', Luca; Volpe, Marco,
A labeled deduction system for the logic UB in 20th International Symposium on Temporal Representation and Reasoning, TIME 2013
, Institute of Electrical and Electronics Engineers Inc.
, Atti di "20th International Symposium on Temporal Representation and Reasoning, TIME 2013"
, Pensacola, Florida, USA
, September 26-28, 2013
, 2013
, pp. 45-53