Titlebook: Computer Science Logic; 10th International W Dirk Dalen,Marc Bezem Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 1997 Compu

infinite

Proofs in system ,, can be done in system ,,,uctors is associated to each term of the system whose unification gives the possible typings. We define a syntactic restriction on constructors which is enough to capture all the typability problems: the elementary calculus. We use these principal typed terms to prove that the higher order typings hierarchy collapse at the second level.

indigenous

FISC

ICLE

Robert H. Spitzer,Elizabeth A. KochThe methods of this paper can be applied as well to intuitionistic proof systems like Natural Deduction. It is obvious that the application of extended reductions similar to projections will result in a loss of confluence; on the other hand, confluence is of doubtful value if the . of cut-elimination is the main concern.

使人煩燥

動(dòng)物

A. S. Lewis,R. Heroux,F. Nolte,P. RobinsonWe extend Belnap‘s Display Logic to give a cut-free Gentzen-style calculus for relation algebras. The calculus gives many axiomatic extensions of relation algebras by the addition of further structural rules. It also appears to be the first purely prepositional Gentzen-style calculus for relation algebras.

財(cái)政

Four-valued diagnoses for stratified knowledge-bases,We present a four-valued approach for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing so automaticly. This method is particularly useful for making model-based diagnoses.

Infantry

蘑菇

Relative undecidability in term rewriting,For two hierarchies of properties of term rewriting systems related to confluence and termination, respectively, we prove .: for implications . in the hierarchies the property . is undecidable for term rewriting systems satisfying ..

迷住