TY - GEN
T1 - Tree-sequent methods for subintuitionistic predicate logics
AU - Ishigaki, Ryo
AU - Kikuchi, Kentaro
PY - 2007/12/24
Y1 - 2007/12/24
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=37249053475&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=37249053475&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:37249053475
SN - 9783540730989
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 149
EP - 164
BT - Automated Reasoning with Analytic Tableaux and Related Methods - 16th International Conference, TABLEAUX 2007, Proceedings
T2 - 16th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2007
Y2 - 3 July 2007 through 6 July 2007
ER -