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
- EP ID EP201802
- DOI 10.12775/LLP.2016.004
- Views 58
- Downloads 0
The lattice of Belnapian modal logics: Special extensions and counterparts
Let K be the least normal modal logic and BK its Belnapian version, which enriches K with ‘strong negation’. We carry out a systematic study of the lattice of logics containing BK based on: • introducing the classes (or...
Informal Fallacies as Abductive Inferences
All who teach logic are familiar with informal fallacies such as ad ignorantium (appeal to ignorance) and ad populum (appeal to popularity). While it is easy to give clear examples of poor reasoning of this sort, instruc...
Mereology and truth-making
Many mereological propositions are true contingently, so we are entitled to ask why they are true. One frequently given type of answer to such questions evokes truth-makers, that is, entities in virtue of whose existence...
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...
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...