Existential second-order logic and modal logic with quantified accessibility relations

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

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

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

منابع مشابه

Existential second-order logic and modal logic with quantified accessibility relations

This article investigates the role of arity of second-order quantifiers in existential second-order logic, also known as Σ1. We identify fragments L of Σ1 where second-order quantification of relations of arity k > 1 is (nontrivially) vacuous in the sense that each formula of L can be translated to a formula of (a fragment of) monadic Σ1. Let polyadic Boolean modal logic with identity (PBML) be...

متن کامل

Existential Second-order Logic over Strings Existential Second-order Logic over Strings – Modified March 1998 –

Existential second-order logic (ESO) and monadic second-order logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ES...

متن کامل

On Quantified Modal Logic

Propositional modal logic is a standard tool in many disciplines, but first-order modal logic is not. There are several reasons for this, including multiplicity of versions and inadequate syntax. In this paper we sketch a syntax and semantics for a natural, well-behaved version of first-order modal logic, and show it copes easily with several familiar difficulties. And we provide tableau proof ...

متن کامل

Expressivity of Second Order Propositional Modal Logic

We consider second order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem-Rosen theorem and the GoldblattThomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of S...

متن کامل

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


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

ژورنال

عنوان ژورنال: Information and Computation

سال: 2016

ISSN: 0890-5401

DOI: 10.1016/j.ic.2016.01.003