Tableau Calculi for the Logics of Finite k-Ary Trees
نویسندگان
چکیده
We present tableau calculi for the logics Dk (k ≥ 2) semantically characterized by the classes of Kripke models built on finite k-ary trees. Our tableau calculi use the signs T and F, some tableau rules for Intuitionistic Logic and two rules formulated in a hypertableau fashion. We prove the Soundness and Completeness Theorems for our calculi. Finally, we use them to prove the main properties of the logics Dk, in particular their constructivity and their decidability.
منابع مشابه
Branches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملLabelled Tableau Calculi Generating Simple Models for Substructural Logics∗
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order to obtain a deductive framework for substructural logics which incorporates the facility of model generation. For this special purpose, we propose new labelled tableau calculi TL and TLe for two substructural logics L (essentially the Lambek calculus) and Le (the multiplicative fragment of intuit...
متن کاملSynthesising and Implementing Tableau Calculi for Interrogative Epistemic Logics
This paper presents a labelled tableau approach for deciding interrogative-epistemic logics (IEL). Tableau calculi for these logics have been derived using a recently introduced tableau synthesis method. We also consider an extension of the framework for a setting with questioning modalities over sequences of formulae called sequential questioning logic (SQL). We have implemented the calculi us...
متن کاملTableau Calculi for KLM Logics: extended version
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered, and w...
متن کاملModal Tableau Systems with Blocking and Congruence Closure
Our interest in this paper are semantic tableau approaches closely related to bottom-up model generation methods. Using equalitybased blocking techniques these can be used to decide logics representable in first-order logic that have the finite model property. Many common modal and description logics have these properties and can therefore be decided in this way. This paper integrates congruenc...
متن کامل