CSL' 87 : proceedings
This volume contains the papers which were presented to the workshop "Computer-Science Logic" held in Karlsruhe on October 12-16, 1987. Traditionally Logic, or more specifically, Mathematical Logic splits into several subareas: Set Theory, Proof Theory, Recursion Theory, and Model Theory....
Saved in:
| Corporate Author: | |
|---|---|
| Other Authors: | , , |
| Format: | Livre numérique |
| Language: | Anglais |
| Published: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
329 |
| Subjects: | |
| Online Access: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CSL' 87, proceedings, 1st Workshop on computer science logic, Karlsruhe, FRG, October 12-16, 1987, 1988, Berlin, Springer-Verlag, 1 vol. (VI-346 p.), Lecture notes in computer science, 3-540-50241-6 • CSL '87, Texte imprimé, 9783662197509 |
Table of Contents:
- Diagonalizing over deterministic polynomial time
- Resolution with feature unification
- Surjectivity for finite sets of combinators by weak reduction
- Proving finite satisfiability of deductive databases
- Is setl a suitable language for parallel programming a theoretical approach
- Loose diagrams, semigroupoids, categories, groupoids and iteration
- Algebraic operational semantics and modula-2
- Program verification using dynamic logic
- Induction in the elementary theory of types and names
- On the computational complexity of quantified Horn clauses
- The conjunctive complexity of quadratic boolean functions
- On type inference for object-oriented programming languages
- Optimization aspects of logical formulas
- Logic of approximation reasoning
- Deciding the path- and word-fair equivalence problem
- Learning by teams from examples with errors
- A survey of rewrite systems
- Interfacing a logic machine
- Complexity cores and hard-to-prove formulas
- On the average case complexity of backtracking for the exact-satisfiability problem
- On functions computable in nondeterministic polynomial time: Some characterizations
- Developing logic programs: Computing through normalizing
- Model theory of deductive databases
- Algorithms for propositional updates.