Tree-Sequent Methods for Subintuitionistic Predicate Logics
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.
Unable to display preview. Download preview PDF.
- 6.Došen, K.: Modal translations in K and D. In: de Rijke, M. (ed.) Diamonds and Defaults, pp. 103–127. Kluwer Academic Publishers, Boston (1993)Google Scholar
- 10.Ishigaki, R., Kikuchi, K.: A tree-sequent calculus for a natural predicate extension of Visser’s propositional logic. To appear in Log. J. IGPLGoogle Scholar
- 12.Kashima, R.: Sequent calculi of non-classical logics — Proofs of completeness theorems by sequent calculi (in Japanese). In: Proceedings of Mathematical Society of Japan Annual Colloquium of Foundations of Mathematics, pp. 49–67 (1999)Google Scholar
- 19.Wansing, H.: Displaying as temporalizing, sequent systems for subintuitionistic logics. In: Akama, S. (ed.) Logic, Language and Computation, pp. 159–178. Kluwer Academic Publishers, Boston (1997)Google Scholar