A Modal Logic for Quanti cationand

نویسنده

  • Yde Venema
چکیده

The aim of this paper is to study the n-variable fragment of rst order logic from a modal perspective. We deene a modal formalism called cylindric mirror modal logic, and show how it is a modal version of rst order logic with substitution. In this approach, we can deene a semantics for the language which is closely related to algebraic logic, as we nd Polyadic Equality Algebras as the modal or complex algebras of our system. The main contribution of the paper is a characterization of the intended`mirror cubic' frames of the formalisms and, a consequence of the special form of this characterization, a completeness theorem for these intended frames. As a consequence, we nd complete nite yet unorthodox derivation systems for the equational theory of nite-dimensional representable polyadic equality algebras.

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

ثبت نام

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

منابع مشابه

Concurrency with partial information

The aim of this paper is to introduce a new formalism for multi-agent systems that captures (true) concurrency and independence. We begin describing a complete and decidable propositional multi-modal logic. The language, similar to Propositional Dynamic Logic in many aspects, di ers from usual modal logic: modal operators are non-atomic (they are built out of basic actions) and capture concurre...

متن کامل

On the Expressive Power of Modal Logics on Trees

Various logical languages are compared regarding their expressive power with respect to models consisting of nitely bounded branching in nite trees The basic multimodal logic with backward and forward necessity operators is equivalent to restricted rst order logic by adding the binary temporal operators since and until we get the expressive power of rst order logic on trees Hence restricted pro...

متن کامل

A Modal Logic for Full LOTOS based on Symbolic Transition Systems

Symbolic transition systems separate data from process behaviour by allowing the data to be uninstantiated Designing a HML like modal logic for these transition systems is interesting because of the subtle interplay between the quanti ers for the data and the modal operators quanti ers on transitions This paper presents the syntax and semantics of such a logic and discusses the design issues in...

متن کامل

Scan and Systems of Conditional Logic

The SCAN algorithm has been proposed for second order quanti er elimination. In particular it can be applied to nd correspondence axioms for systems of modal logic. Up to now, what has been studied are systems with unary modal operators. In this paper we study how SCAN can be applied to various systems of conditional logic, which are logical systems with binary modal operators.

متن کامل

A Variant of Thomason ' s First - order Logic CFBased

In this paper, we de ne a rst-order logic CF 0 with strong negation and bounded classical quanti ers, which is a variant of Thomason's logic CF . For the logic CF 0, the usual Kripke formal semantics is dened based on situations, and a sound and complete axiomatic system is established based on the axiomatic systems of constructive logics with strong negation and Thomason's completeness proof t...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1994