Temporal logic query checking was first introduced by William Chan [3] to speed up design understanding by discovering properties not known a priori. A query is a temporal logic formula containing a special symbol ?1, known as a placeholder. Given a Kripke structure and a propositional formula ', we say that ' satisfies the query if replacing the placeholder by ' results in a temporal logic for...

We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.

In this paper we give perspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC K GL and S Grz using bounded bisim ulations

We survey recent results about the relation between Datalog and temporal veriication logics. Datalog is a well-known database query language relying on the logic programming paradigm. We introduce Dat-alog LITE, a fragment of Datalog with well-founded negation, which has an easy stratiied semantics and a linear time model checking algorithm. Datalog LITE subsumes temporal languages such as CTL ...

In the manuscript titled " Computation environment (1) " , we introduced a notion called computation environment as an interactive model for computation and complexity theory. In this model, Turing machines are not autonomous entities and find their meanings through the interaction between a computist and a universal processor, and thus due to evolution of the universal processor, the meanings ...

The paper proposes a condition for preserving the KD45n property of a Kripke model when a sequence of update models is applied to it. The paper defines the notions of a primitive update model and a semi-reflexive KD45n (or sr-KD45n) Kripke model. It proves that updating a sr-KD45n Kripke model using a primitive update model results in a sr-KD45n Kripke model, i.e., a primitive update model pres...

Abstract We translate the three-valued quantum logic into modal logic, and prove 3-equivalence between valuation of a kind Kripke model in regard to this translation. To 3-equivalence, we introduce an observable-dependent which is fragment many-valued logic. Compared Birkhoff von Neumann’s some notions about observables, completeness relation for example, mechanics can be utilized if employed.

This work presents three increasingly expressive Dynamic Logics in which the programs are described in a language based on CCS. Our goal is to build dynamic logics that are suitable for the description and verification of properties of communicating concurrent systems, in a similar way as PDL is used for the sequential case. In order to accomplish that, CCS’s operators and constructions are add...

The paper investigates a simple and natural enrichment of the usual modal language !£ = !£<O) with an auxiliary 'universal' modality [!!) having Kripke semantics: [!!)� is true at a world of a model iff � is valid in the model. The enriched language � = !£<O, [!!) turns out to be fairly different from the classical one. In particular the notions of satisfiability, validity and consequence in mo...

In 1979, Fischer and Ladner introduced Propositional Dynamic Logic (PDL) as a logical formalism for reasoning about programs [9]. Since then, PDL has become a classic of logic in computer science [11], and many extensions and variations have been proposed. Several of these extensions are inspired by the original application of reasoning about programs, while others aim at the numerous novel app...