منابع مشابه
Modularity of Completeness Revisited
One of the key results in the eld of modularity for Term Rewriting Systems is the modularity of completeness for left linear TRSs established by Toyama Klop and Barendregt in TKB The proof however is quite long and involved In this paper a new proof of this basic result is given which is both short and easy employing the powerful technique of pile and delete already used with success in proving...
متن کاملKripke completeness revisited
The evolution of completeness proofs for modal logic with respect to the possible world semantics is studied starting from an analysis of Kripke’s original proofs from 1959 and 1963. The critical reviews by Bayart and Kaplan and the emergence of Henkin-style completeness proofs are detailed. It is shown how the use of a labelled sequent system permits a direct and uniform completeness proof for...
متن کاملDenotational Completeness Revisited
We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.
متن کاملImplicational Completeness of Signed Resolution
1 Implicational completeness-a neglected topic Every serious computer scientist and logician knows that resolution is complete for rst-order clause logic. By this, of course, one means that the empty clause (representing contradiction) is derivable by resolution from every unsatissable set of clauses S. However, there is another { less well known { concept of completeness for clause logic, that...
متن کاملProving Ground Completeness of Resolution by Proof Planning Proving Ground Completeness of Resolution by Proof Planning
A lot of the human ability to prove hard mathematical theorems can be ascribed to a domain-speciic problem solving know-how. Such knowledge is intrin-sically incomplete. In order to solve related problems, human mathematicians can go beyond their acquired knowledge by adapting their know-how. These two aspects, having rich experience and extending it by need, can be simulated in a proof plannin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90139-9