COLOG-88 International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, Proceedings

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 syst...

Full description

Bibliographic Details
Other Authors: Martin-Löf, Per (Editor), Mints, Grigori (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1990, 1990
Edition:1st ed. 1990
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03227nmm a2200409 u 4500
001 EB000657509
003 EBX01000000000000001349329
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540469636 
100 1 |a Martin-Löf, Per  |e [editor] 
245 0 0 |a COLOG-88  |h Elektronische Ressource  |b International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, Proceedings  |c edited by Per Martin-Löf, Grigori Mints 
250 |a 1st ed. 1990 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1990, 1990 
300 |a VI, 339 p  |b online resource 
505 0 |a 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-Löf'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 
653 |a Programming Techniques 
653 |a Computer science 
653 |a Computer programming 
653 |a Mathematical logic 
653 |a Artificial Intelligence 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Artificial intelligence 
653 |a Science / Philosophy 
653 |a Mathematical Logic and Foundations 
653 |a Theory of Computation 
653 |a Philosophy of Science 
700 1 |a Mints, Grigori  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-52335-9 
856 4 0 |u https://doi.org/10.1007/3-540-52335-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.0151 
520 |a 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