COLOG-88 : International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, proceedings
Author(s)
Bibliographic Information
COLOG-88 : International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, proceedings
（Lecture notes in computer science, 417）
Springer-Verlag, c1990
- : gw
- : us
Available at / 60 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||41790006885
-
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:417901000390
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
This volume contains several invited papers as well as a selection of the other contributions. The conference was the first meeting of the Soviet logicians interested in com- puter science with their Western counterparts. The papers report new results and techniques in applications of deductive systems, deductive program synthesis and analysis, computer experiments in logic related fields, theorem proving and logic programming. It provides access to intensive work on computer logic both in the USSR and in Western countries.
Table of Contents
Algebraic specified processes and enumerable models.- On conditions of full coherence in biclosed categories: A new application of proof theory.- The use of justification systems for integrated semantics.- An equational deductive system for the differential and integral calculus.- Inductively defined types.- Algorithms for probabilistic inference.- Geometry of interaction 2: Deadlock-free algorithms.- On the syntax of infinite objects: an extension of Martin-Loef's theory of expressions.- ?-Reductions and ?-developments of ?-terms with the least number of steps.- Group-theoretic approach to intractable problems.- On some applications of Heyting-valued analysis II.- Mathematics of infinity.- Gentzen-type systems and resolution rules part I propositional logic.- On the problem of reducing search in logic program execution.- Correctness of short proofs in theory with notions of feasibility.- A formulation of the simple theory of types (for Isabelle).- On connections between classical and constructive semantics.- Flow-diagrams with sets.- The resolution program, able to decide some solvable classes.- A structural completeness theorem for a class of conditional rewrite rule systems.- A proof-search method for the first order logic.
by "Nielsen BookData"
