Reasoning about Intuitionistic Computation Tree Logic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Reasoning about Intuitionistic Computation Tree Logic

Résumé

In this paper, we define an intuitionistic version of Computation Tree Logic. After explaining the semantic features of intuitionistic logic, we examine how these characteristics can be interesting for formal verification purposes. Subsequently, we define the syntax and semantics of our intuitionistic version of CTL and study some simple properties of the so obtained logic. We conclude by demonstrating that some fixed-point axioms of CTL are not valid in the intuitionistic version of CTL we have defined.

Dates et versions

hal-04336273 , version 1 (11-12-2023)

Identifiants

Citer

Davide Catta, Aniello Murano, Vadim Malvone. Reasoning about Intuitionistic Computation Tree Logic. AREA 2023, Sep 2023, Krakow (Cracovie), Poland. pp.42-48, ⟨10.4204/EPTCS.391.6⟩. ⟨hal-04336273⟩
23 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More