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 53
- Downloads 0
The Case of Dialetheism
The concept of dialetheia and the claim of dialetheism has been examined and compared to such related concept as contradiction, antinomy, consistency and paraconsistency. Dialetheia is a true contradiction and dialetheis...
Composition, identity, and emergence
Composition as Identity (CAI) is the thesis that a whole is, strictly and literally, identical to its parts, considered collectively. McDaniel [2008] argues against CAI in that it prohibits emergent properties. Recently...
Relational semantics for the 4-valued relevant logics BN4 and E4
The logic BN4 was defined by R.T. Brady in 1982. It can be considered as the 4-valued logic of the relevant conditional. E4 is a variant of BN4 that can be considered as the 4-valued logic of (relevant) entailment. The a...
Interplays of knowledge and non-contingency
This paper combines a non-contingency logic with an epistemic logic by means of fusions and products of modal systems. Some consequences of these interplays are pointed out.
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.