Paper Info
Title
Tableau Calculi for the Logics of Finite k-Ary Trees
Abstract
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.
Year
DOI
Venue
2002
10.1007/3-540-45616-3_9
TABLEAUX
Keywords
Field
DocType
completeness theorems,logics dk,kripke model,hypertableau fashion,tableau rule,main property,tableau calculus,finite k-ary trees,tableau calculi,finite k-ary tree,intuitionistic logic
Intuitionistic logic,Discrete mathematics,Algorithm,Propositional calculus,Decidability,Soundness,Completeness (statistics),Kripke models,Intermediate logic,Mathematics
Conference
ISBN
Citations 
PageRank 
3-540-43929-3
0
0.34
References 
Authors
10
3
Name
Order
Citations
PageRank
Mauro Ferrari19316.05
Camillo Fiorentini212121.00
Guido Fiorino39712.71