A Fully Internalized Sequent Calculus for Hybrid Categorial Logics

نویسنده

  • Magdalena Ortiz
چکیده

In this paper, a sequent calculus for a hybrid categorial type logic (HCTL) is obtained following Seligman’s internalization strategy (Seligman 2001). With this strategy, a sequent calculus for a hybrid language can be developed starting from a first order sequent calculus. Seligman exemplifies his strategy developing a calculus for hybrid modal logics, but rises the question of whether the strategy works in general. We investigate this issue in the particular case of categorial type logics. As categorial type logics lack Boolean structure, a successful hybridization would indicate that the strategy is indeed rather general and does not depend on the availability of Boolean connectives. In this paper, we will see that this is the case, and moreover, since we can easily arrive to an intuitionistic version of the calculus, we will see that a classical base is not needed either.

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

ثبت نام

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

منابع مشابه

Internalization: The Case of Hybrid Logics

A sequent calculus for hybrid logics is developed from a calculus for classical predicate logic by a series of transformations. We formalize the semantic theory of hybrid logic using a sequent calculus for predicate logic plus axioms. This works, but it is ugly. The unattractive features are removed one-by-one, until the final vestiges of the metalanguage can be set aside to reveal a fully inte...

متن کامل

Bringing them all Together

A sequent calculus for hybrid logics is developed from a calculus for classical predicat logic by a series of transformations. We formalize the semantic theory of hybrid logic using a sequent calculus for predicate logic plus axioms. This works, but it is ugly. The unnattractive features are removed one-by-one, until the final vestiges of the metalanguage can be set aside to reveal a fully inte...

متن کامل

Categorial Grammars and Substructural Logics

Substructural logics are formal logics whose Gentzen-style sequent systems abandon some/all structural rules (Weakening, Contraction, Exchange, Associativity). They have extensively been studied in current literature on nonclassical logics from different points of view: as sequent axiomatizations of relevant, multiple-valued and fuzzy logics [73, 44], as so-called resource-sensitive logics for ...

متن کامل

Simple Cut Elimination Proof for Hybrid Logic

In the paper we present a relatively simple proof of cut elimination theorem for variety of hybrid logics in the language with satisfaction operators and universal modality. The proof is based on the strategy introduced originally in the framework of hypersequent calculi but it works well also for standard sequent calculi. Sequent calculus examined in the paper works on so called satisfaction f...

متن کامل

Labeled Sequent Calculus and Countermodel Construction for Justification Logics

Justification logics are modal-like logics that provide a framework for reasoning about epistemic justifications. This paper introduces labeled sequent calculi for justification logics, as well as for hybrid modal-justification logics. Using the method due to Sara Negri, we internalize the Kripke-style semantics of justification logics, known as Fitting models, within the syntax of the sequent ...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2006