Tree-sequent methods for subintuitionistic predicate logics

Ryo Ishigaki, Kentaro Kikuchi

研究成果: Conference contribution

9 被引用数 (Scopus)

抄録

Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate logics of this kind by the method of tree-sequent calculus (a special form of Labelled Deductive System). After proving the completeness with respect to some classes of Kripke models, we introduce Hilbert-style axiom systems and prove their completeness through a translation from the tree-sequent calculi. This gives a solution to the problem posed by Restall.

本文言語English
ホスト出版物のタイトルAutomated Reasoning with Analytic Tableaux and Related Methods - 16th International Conference, TABLEAUX 2007, Proceedings
ページ149-164
ページ数16
出版ステータスPublished - 2007 12月 24
イベント16th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2007 - Aix en Provence, France
継続期間: 2007 7月 32007 7月 6

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4548 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other16th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2007
国/地域France
CityAix en Provence
Period07/7/307/7/6

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Tree-sequent methods for subintuitionistic predicate logics」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル