The Logic of "Initially" and "Next": Complete Axiomatization and Complexity
نویسندگان
چکیده
In 3], a large number of completeness results about variants of discrete linear-time temporal logic are obtained. One of them is left as an open problem: the completeness of the logic of initially and next, for which a deductive system is proposed. This simple logic is of practical importance, since the proof of program invariants only require these modalities. We show here that the conjectured medium completeness of this system indeed holds; further, we show that deciding this entailment is PSpace-complete, while deciding validity is only coNP-complete.
منابع مشابه
Axiomatization and complexity of modal logic with knowing-what operator on model class K
Standard epistemic logic studies propositional knowledge, yet many other types of knowledge such as “knowing whether”, “knowing what”, “knowing how” are frequently and widely used in everyday life as well as academic fields. In [11], an axiomatization of the epistemic logic with both regular “knowing that” operator and “conditionally knowing what” operator is given. Then the decidability and co...
متن کاملA Probabilistic Logic for Reasoning about Uncertain Temporal Information
The main goal of this work is to present the proof-theoretical and model-theoretical approach to a probabilistic logic which allows reasoning about temporal information. We extend both the language of linear time logic and the language of probabilistic logic, allowing statements like “A will always hold”and “the probability that A will hold in next moment is at least the probability that B will...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملComplete axiomatization of the stutter-invariant fragment of the linear time μ-calculus
The logic μ(U) is the fixpoint extension of the “Until”-only fragment of linear-time temporal logic. It also happens to be the stutter-invariant fragment of linear-time μ-calculus μ(♦). We provide complete axiomatizations of μ(U) on the class of finite words and on the class of ω-words. We introduce for this end another logic, which we call μ(♦Γ), and which is a variation of μ(♦) where the Next...
متن کاملFuture Event Logic - Axioms and Complexity
In this paper we present a sound and complete axiomatization of future event logic. Future event logic is a logic that generalizes a number of dynamic epistemic logics, by using a new operator . that acts as a quantifier over the set of all refinements of a given model. (A refinement is like a bisimulation except that from the three relational requirements only ‘atoms’ and ‘back’ need to be sat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 69 شماره
صفحات -
تاریخ انتشار 1999