Conference on Computer Logic 1988: Tallinn, USSR

Per Martin-Löf, Grigori Mints (Eds.): COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings. Lecture Notes in Computer Science 417 Springer 1990, ISBN 3-540-52335-9

Andrei S. Morozov:
Algebraic specified processes and enumerable models. 1-2
A. A. Babaev, Sergei Soloviev:
On conditions of full coherence in biclosed categories: a new application of proof theory. 3-8
N. G. de Bruijn:
The use of justification systems for integrated semantics. 9-24
Rolando Chuaqui, Patrick Suppes:
An equational deductive system for the differential and integral calculus. 25-49
Thierry Coquand, Christine Paulin:
Inductively defined types. 50-66
Evgeny Dantsin:
Algorithms for Probabilistic Inference. 67-75
Jean-Yves Girard:
Geometry of interaction 2: deadlock-free algorithms. 76-93
Lars Hallnäs:
On the syntax of infinite objects: an extension of Martin-Löf's theory of expressions. 94-104
Zurab Khasidashvili:
beta-reductions and beta developments of lambda terms with the least number of steps. 105-111
Vladik Kreinovich:
Group-theoretic approach to intractable problems. 112-121
V. A. Lyubetsky:
On some applications of Heyting-valued analysis II. 122-145
Per Martin-Löf:
Mathematics of infinity. 146-197
Grigori Mints:
Gentzen-type systems and resolution rules. Part I. Propositional logic. 198-231
Vladimir S. Neiman:
On the problem of reducing search in logic program execution. 232-241
Vladimir P. Orevkov:
Correctness of short proofs in theory with notions of feasibility. 242-245
Lawrence C. Paulson:
A formulation of the simple theory of types (for Isabelle). 246-274
Sergei Starchenko, Andrei Voronkov:
On connections between classical and constructive semantics. 275-285
Alexei P. Stolboushkin:
Flow-diagrams with sets. 286-299
Tanel Tammet:
The resolution program, able to decide some solvable classes. 300-312
Sergei G. Vorobyov:
A structural completeness theorem for a class of conditional rewrite rule systems. 313-326
Andrei Voronkov:
A proof-search method for the first-order logic. 327-338

Last update Sat May 18 18:17:42 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page