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
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...
Set-theoretic mereology
We consider a set-theoretic version of mereology based on the inclusion relation ⊆ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of ∈ from ⊆, we identify the...
Category Free Category Theory and Its Philosophical Implications
There exists a dispute in philosophy, going back at least to Leibniz, whether is it possible to view the world as a network of relations and relations between relations with the role of objects, between which these relat...
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.
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...