InhaltsangabeHonest polynomial-time degrees of elementary recursive sets.- On the verification of modules.- A logical operational semantics of full Prolog.- Set-theoretic reductions of Hilbert's tenth problem.- The complexity of subtheories of the existential linear theory of reals.- On test classes for universal theories.- Generalizing allowedness while retaining completeness of SLDNF-resolution.- Effectively given information systems and domains.- Davis-Putnam resolution versus unrestricted resolution.- On logical descriptions of some concepts in structural complexity theory.- Algebraic operational semantics and Occam.- Propositional provability and models of weak arithmetic.- Polymorphic recursion and semi-unification.- Deciding Horn classes by hyperresolution.- ?-branching programs of bounded width.- A predicate calculus with control of derivations.- Reducibility of monotone formulas to ?-formulas.- New ways for developing proof theories for first-order multi modal logics.- On the representation of data in lambda-calculus.- A streamlined temporal completeness theorem.- A concurrent branching time temporal logic.- Semantic for abstract fairness using metric spaces.- On the average time complexity of set partitioning.- A direct proof for the completeness of SLD-resolution.- A quantifier-free completion of logic programs.- Stratification of definite clause programs and of general logic programs.- The semantics of disjunctive deductive databases.- Sequential representation of primitive recursive functions, and complexity classes.