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...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
417 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computer logic, International Conference COLOG-88, Tallinn, USSR, December 1988, proceedings, P. Martin-Löf, G. Mints, eds, Berlin, Springer-Verlag, 1990, 1 vol. (VI-338 p.), Lecture notes in computer science, 0-387-52335-9 • COLOG-88, Texte imprimé, 9783662171172 |
Obsah:
- 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.