Completeness of a Branching-Time Logic with Possible Choices
نویسندگان
چکیده
In this paper we present BTC, which is a logic for branching-time whose modal operator quantifies over histories and temporal operators involves a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL expresses an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as for instance
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملAn Extended Branching-Time Ockhamist Temporal Logic
For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated “restricted variables” called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modal...
متن کاملA clausal resolution method for CTL branching-time temporal logic
In this paper we extend our clausal resolution method for linear time temporal logics to a branching-time framework. Thus, we propose an e cient deductive method useful in a variety of applications requiring an expressive branching-time temporal logic in AI. The branching-time temporal logic considered is Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class. T...
متن کاملSequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” with the branching temporal logic operator “on all paths”. The latter operator is interpreted with respect to a version of the bundle semantics. In addition the temporal logic of knowledge (belief) contains an indexed set of ...
متن کاملMathematical Logic The taming of recurrences in computability logic through cirquent calculus, Part II
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ¬, parallel conjunction ∧, parallel disjunction ∨, branching recurrence ◦| , and branching corecurrence ◦| . The article is published in two parts, with (the previous) Part I containing prelimin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 96 شماره
صفحات -
تاریخ انتشار 2010