z-logo
open-access-imgOpen Access
Extended full computation-tree logics for paraconsistent model checking
Author(s) -
Norihiro Kamide
Publication year - 2007
Publication title -
logic and logical philosophy
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.416
H-Index - 10
eISSN - 2300-9802
pISSN - 1425-3305
DOI - 10.12775/llp.2006.015
Subject(s) - computation tree logic , bisimulation , model checking , ctl* , computer science , abstraction , translation (biology) , theoretical computer science , computation , paraconsistent logic , tree (set theory) , algorithm , mathematics , discrete mathematics , programming language , description logic , combinatorics , multimodal logic , biochemistry , chemistry , philosophy , cytotoxic t cell , epistemology , messenger rna , in vitro , gene

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom