Conference on Computer Logic 1988: Tallinn, USSR

@proceedings{DBLP:conf/colog/1988,
  editor    = {Per Martin-L{\"o}f and
               Grigori Mints},
  title     = {COLOG-88, International Conference on Computer Logic, Tallinn,
               USSR, December 1988, Proceedings},
  booktitle = {Conference on Computer Logic},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {417},
  year      = {1990},
  isbn      = {3-540-52335-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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