Modal Deduction in Second-Order Logic and Set Theory - II

نویسندگان

  • Johan van Benthem
  • Giovanna D'Agostino
  • Angelo Montanari
  • Alberto Policriti
چکیده

In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in 11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, deening a new set-theoretic function symbol for each new modal operator, we develop a general framework within which a number of extended modal logics can be dealt with. More precisely, we extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to tailor such a translation to deal with speciic cases of extended modal logics.

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

ثبت نام

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

منابع مشابه

Modal Deduction in Second-Order Logic and Set Theory - I

In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in 11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We rst extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable c...

متن کامل

W-JS: A Modal Logic of Knowledge

W-JS is a first-order predicate calculus on the modal theory of knowledge. It is based on natural deduction rules and accompanied by possible-world-accessibility semantics. As an example, the famous "Mr. S and Mr. P" puzzle is solved in W-JS.

متن کامل

A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics

In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, whose distinctive feature is the ability of representing and reasoning about finite quantities. Each member of this class can be represented using graded modalities, and thus the considered problem can be reduced to the p...

متن کامل

Tractable Transformations from Modal Provability Logics into First-Order Logic

We deene a class of modal logics LF by uniformly extending a class of modal logics L. Each logic L is characterised by a class of rst-order deenable frames, but the corresponding logic LF is sometimes characterised by classes of modal frames that are not rst-order deenable. The class LF includes provability logics with deep arithmeti-cal interpretations. Using Belnap's proof-theoretical framewo...

متن کامل

Uniform relational frameworks for modal inferences

The design and the implementation of variable-free deductive frameworks (ultimately based on Tarski’s arithmetic of dyadic relations) for aggregate theories, strongly rely on the availability of suitable pairing notions. Thanks to a set-theoretical treatment of modalities, we show that even in the case of modal propositional logics, an appropriate pairing notion can be introduced and exploited ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Studia Logica

دوره 60  شماره 

صفحات  -

تاریخ انتشار 1998