| H. C. M. De Swart. A Gentzen- or Beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactual logics V C and V CS. Journal of Symbolic Logic, 48: 1--20, 1983. |
....Unfortunately, CLs are not particularly well suited for investigating nonmonotonic forms of inference in proof theoretic terms. In fact, in contrast with the striking development of CL s semantic setting, its inferential structure has remained largely unexplored (notable exceptions are [Tho70] and [Swa83]) Most importantly, it has not been su#ciently explored to provide automated deduction methods for e#ectively computing non monotonic inference relations. We know only two attempts in this direction: Groeneboer and Delgrande s [GD88] and Lamarre s [Lam92] tableau based theorem provers for some ....
H. C. M. De Swart. A Gentzen- or Beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactual logics V C and V CS. Journal of Symbolic Logic, 48: 1--20, 1983.
....to provide reliable automated deduction methods for effectively computing the inferences sanctioned by cumulative reasoning. In fact, in contrast with the striking development of CL s semantic setting, its inferential structure has remained largely unexplored (with the notable exceptions of [39, 14, 23, 35]) To accomplish the above goal we shall proceed by first looking for a suitable CL that can be used as an appropriate counterpart of the class of cumulative consequence relations. Such a logic, called CU, is a simple extension of Chellas [10] basic normal system CK. Actually, our tableau proof ....
Herrie de Swart. A Gentzen- or Beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactuals logics vc and vcs. Journal of Symbolic Logic, 48:1--20, 1983.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC