Description

• Tytuł:
  Simple cut elimination proof for hybrid logic
• Twórca:
  Indrzejczak, Andrzej
• Opis:
  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.
• Dostępność obiektu:
  free access
• Prawa:
  Prawa autorskie (c) 2017 Logic and Logical Philosophy
• Data:
  2016.04.04
• Typ:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion
• Język:
  English
• Źródło:
  Logic and Logical Philosophy; Vol. 25 No. 2 (2016): June; 129-141;
  Logic and Logical Philosophy; Tom 25 Nr 2 (2016): czerwiec; 129-141;
  2300-9802;
  1425-3305
• Format:
  application/pdf
• Wydawca:
  Uniwersytet Mikołaja Kopernika w Toruniu
• Relacja: https://apcz.umk.pl/LLP/article/view/LLP.2016.004/8974
• Temat i słowa kluczowe:
  hybrid logic;
  cut elimination theorem;
  hypersequent calculi;
  sequent calculi;
  geometric conditions
• Identyfikator: https://apcz.umk.pl/LLP/article/view/LLP.2016.004
• Dostawca danych:
  Akademicka Platforma Czasopism
• Czy mogę z tego obiektu skorzystać?:
  seek permission
• Rodzaj zawartości:
  text