Results found: 1

Search results

Search:
in the keywords: cut elimination theorem

Sort By:

Limit search:

Simple cut elimination proof for hybrid logic

100%

Indrzejczak A.

Logic and Logical Philosophy

2016

vol. 25

issue 2

129–141

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.

Refine search results

1 Logic and Logical Philosophy

1 2016

1 Indrzejczak A.

Search results

Simple cut elimination proof for hybrid logic