## COLOG-88: International Conference on Computer Logic, Tallinn, USSR, December 12-16, 1988, ProceedingsThis 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A Morozov | 1 |

R Chuaqui and P Suppes | 25 |

T Coquand and C Paulin | 50 |

E Ya Dantsin | 67 |

Hallnas | 94 |

Ya Kreinovich | 112 |

P MartinLof | 146 |

G Mints | 198 |

S Neiman | 232 |

### Other editions - View all

COLOG-88: International Conference on Computer Logic, Tallinn, USSR ... Per Martin-Löf Limited preview - 1990 |

COLOG-88: International Conference on Computer Logic, Tallinn, USSR ... Per Martin-Löf,Grigori Mints No preview available - 1990 |

Colog-88: International Conference on Computer Logic, Tallinn, USSR ... Per Martin-Lof,Grigori Mints No preview available - 2014 |

### Common terms and phrases

algebra algorithm apply arbitrary arity assume atomic messages Automath Axiom of Choice axioms bool Boolean calculus calculus of constructions called classical complete Computer Science Conclusion condition consider construction contains corresponding datatype defined definition denote derivation disjunct element equality equations equivalent example exists expressions FDSet finite formula F function Gentzen-type hence higher-order logic impredicative induction inference engine inference rules infinite integrals interpretation introduce intuitionistic Isabelle justification system lambda calculus language Lemma literals logic programming Martin-L6f mathematical metalanguage modal modal logics model companion natural numbers neighborhood nilpotent nonstandard truth nonstandardly true normal notation notion objects obtain occurs operator optimal oracle machine predicate Premise line primitive probability problem Proceedings proof propositional propositional calculus prove quantifiers recursive redexes reduction replacement ring satisfies semantics sequent set theory solutions standard strategy subformula subgoal substitution subterms symbols Theorem type theory variables