Abstract : We introduce a notion of proof for CTL with respect to a given nite model and show some advantages of using such a notion. This also suggests to de ne a slight extension of CTL, called SCTL, where predicates can have an arbitrary arity.
https://hal.inria.fr/hal-00919467 Contributor : Gilles DowekConnect in order to contact the contributor Submitted on : Friday, January 17, 2014 - 5:37:18 PM Last modification on : Friday, January 21, 2022 - 3:15:42 AM Long-term archiving on: : Friday, April 18, 2014 - 11:22:21 AM