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
Mereology and Infinity
This paper deals with the treatment of infinity and finiteness in mereology. After an overview of some first-order mereological theories, finiteness axioms are introduced along with a mereological definition of “x is fin...
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...
Rational Agency from a Truth-Functional Perspective
The aim of the present paper is to introduce a system, where the epistemic state of an agent is represented truth-functionally. In order to obtain this system, we propose a four-valued logic, that we call the logic of ra...
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.
Refutation Systems for a System of Nonsense-Logic
In the paper rejection systems for a system of nonsense-logic are investigated. The first rejection system consists of four rejected axioms and only one rejection rule - the rule of rejection by detachment. The second o...