Computer Science Logic 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers
This volume presents the proceedings of the Computer Science Logic Workshop CSL '92, held in Pisa, Italy, in September/October 1992. CSL '92 was the sixth of the series and the first one held as Annual Conference of the European Association for Computer Science Logic (EACSL). Full versions...
| Other Authors: | , , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1993, 1993
|
| Edition: | 1st ed. 1993 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- A universal Turing machine
- Recursive inseparability in linear logic
- The basic logic of proofs
- Algorithmic structuring of cut-free proofs
- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions
- Linear ?-calculus and categorical models revisited
- A self-interpreter of lambda calculus having a normal form
- An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic
- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness
- Model building by resolution
- Comparative transition system semantics
- Reasoning with higher order partial functions
- Communicating evolving algebras
- On the completeness of narrowing as the operational semantics of functional logic programming
- Inductive definability with counting on finite structures
- Linear time algorithms and NP-complete problems
- The semantics of the C programming language
- A theory of classes for a functional language with effects
- Logical definability of NP-optimisation problems with monadic auxiliary predicates
- Universes in the theories of types and names
- Notes on sconing and relators
- Solving 3-satisfiability in less than 1, 579n steps
- Kleene's slash and existence of values of open terms in type theory
- Negation-complete logic programs
- Logical characterization of bounded query classes II: Polynomial-time oracle machines
- On asymptotic probabilities of monadic second order properties