Tree-sequent methods for subintuitionistic predicate logics

Ryo Ishigaki, Kentaro Kikuchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 16th International Conference, TABLEAUX 2007, Proceedings
Pages149-164
Number of pages16
Publication statusPublished - 2007 Dec 24
Event16th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2007 - Aix en Provence, France
Duration: 2007 Jul 32007 Jul 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4548 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Tree-sequent methods for subintuitionistic predicate logics'. Together they form a unique fingerprint.

Cite this