First-order logics of branching time

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidable and Undecidable Fragments of First-Order Branching Temporal Logics

In this paper we analyze the decision problem for fragments of first-order extensions of branching time temporal logics such as computational tree logics CTL and CTL or Prior’s Ockhamist logic of historical necessity. On the one hand, we show that the one-variable fragments of logics like first-order C T L —such as the product of propositional C T L with simple propositional modal logic S5, or ...

متن کامل

Hybrid Branching-Time Logics

Hybrid branching-time logics are introduced as extensions of CT L-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive power and the complexity of satisfiability of the resulting logics is investigated. As main result, the satisfiability problem for the hybrid versions of sever...

متن کامل

First-order Gödel logics

First-order Gödel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics GV (sets of those formulas which evaluate to 1 in every interpretation into V ). It is shown that GV is axiomatizable iff V is finite, V is uncountable with 0 isolated in V , or eve...

متن کامل

An Axiomatization of a First-order Branching Time Temporal Logic

We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomatization for the considered logic.

متن کامل

A First-Order Branching Time Logic of Multi-Agent System

This paper presents a first-order branching time temporal logic that is suitable for describing and reasoning about a wide class of computational multi-agent systems. The logic is novel in that it supports reasoning about the beliefs, actions, goals, abilities and structure of groups of agents. A sound proof system for the logic is presented, and some short examples are given, showing how the l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Investigations

سال: 2013

ISSN: 2413-2713,2074-1472

DOI: 10.21146/2074-1472-2013-19-0-68-99