Reasoning about Intuitionistic Computation Tree Logic
Logic in Computer Science
2023-10-05 v1 Artificial Intelligence
Abstract
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.
Cite
@article{arxiv.2310.02355,
title = {Reasoning about Intuitionistic Computation Tree Logic},
author = {Davide Catta and Vadim Malvone and Aniello Murano},
journal= {arXiv preprint arXiv:2310.02355},
year = {2023}
}
Comments
In Proceedings AREA 2023, arXiv:2310.00333