Simple cut elimination proof for hybrid logic

Journal Title: Logic and Logical Philosophy - Year 2016, Vol 25, Issue 2

Abstract

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 formulae and cover all logics adequate with respect to classes of frames defined by so called geometric conditions.

Authors and Affiliations

Andrzej Indrzejczak

Keywords

Related Articles

Composition as identity and plural Cantor's theorem

In this paper, I argue that the thesis of Composition as Identity blocks the plural version of Cantor’s Theorem, and that this in turn has implications for our use of Cantor’s theorem in metaphysics. As an example, I sho...

On some extensions of the class of MV-algebras

In the present paper we will ask for the lattice L(MVEx) of subvarieties of the variety defined by the set Ex(MV) of all externally compatible identities valid in the variety MV of all MV-algebras. In particular, we will...

Aristotle's Correspondence Theory of Truth and What Does Not Exist

While nowhere does he use the term to refer to his own theory, Aristotle is often thought to exemplify an early correspondence theory of truth. In the paper, I examine the textual evidence used to support the idea that A...

Sequents for non-wellfounded mereology

The paper explores the proof theory of non-wellfounded mereology with binary fusions and provides a cut-free sequent calculus equivalent to the standard axiomatic system.

The mereology of structural universals

This paper explores the mereology of structural universals, using the structural richness of a non-classical mereology without unique fusions. The paper focuses on a problem posed by David Lewis, who using the example of...

Download PDF file
  • EP ID EP201802
  • DOI 10.12775/LLP.2016.004
  • Views 62
  • Downloads 0

How To Cite

Andrzej Indrzejczak (2016). Simple cut elimination proof for hybrid logic. Logic and Logical Philosophy, 25(2), 129-141. https://europub.co.uk/articles/-A-201802