CSL '87: 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings
Egon Börger, Hans Kleine Büning, Michael M. Richter
Springer Science & Business Media, Sep 14, 1988 - Computers - 348 pages
This volume contains the papers which were presented to the workshop "Computer-Science Logic" held in Karlsruhe on October 12-16, 1987. Traditionally Logic, or more specifically, Mathematical Logic splits into several subareas: Set Theory, Proof Theory, Recursion Theory, and Model Theory. In addition there is what sometimes is called Philosophical Logic which deals with topics like nonclassical logics and which for historical reasons has been developed mainly at philosphical departments rather than at mathematics institutions. Today Computer Science challenges Logic in a new way. The theoretical analysis of problems in Computer Science for intrinsic reasons has pointed back to Logic. A broad class of questions became visible which is of a basically logical nature. These questions are often related to some of the traditional disciplines of Logic but normally without being covered adequately by any of them. The novel and unifying aspect of this new branch of Logic is the algorithmic point of view which is based on experiences people had with computers. The aim of the "Computer-Science Logic" workshop and of this volume is to represent the richness of research activities in this field in the German-speaking countries and to point to their underlying general logical principles.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
A-core model A-gates algebra algorithm applied arbitrary assume atoms automata automaton axiom backtracking Boolean bounded calculus called characterization clauses co-NP complete bipartite graphs complexity Computer Science consider consistent construct contains corresponding database defined definition denoted diagonalization dynamic elements equivalent example exists extended feature terms finite satisfiability formulas given goal graph groupoid Hence Herbrand homomorphism Horn clauses implies induction infinite input iteration labels Lemma Logic Programming loop maximally consistent set Modula natural numbers node nondeterministic normal form obtain operational semantics operator optimization parse tree partial path path-fair polynomial predicate logic problem Proc procedure programming language Prolog Prolog programs proof system Proposition prove quadratic functions quantified recursive recursive sets reduction result rewrite semantics semigroupoid sequence string subset subterm subtree surjective T-model Theorem theory transformations transition rule transitive closure type inference type variables unsatisfiable update word-fair