Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991 : proceedings (Book, 1991) []
skip to content
Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991 : proceedings Preview this item
ClosePreview this item

Computer science logic : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991 : proceedings

Author: E Börger
Publisher: Berlin ; New York : Springer-Verlag, ©1992.
Series: Lecture notes in computer science, 626.
Edition/Format:   Print book : Conference publication : EnglishView all editions and formats

The results of a workshop, this volume contains a series of essays on a variety of logical topics in computer science, including abstract data types, bounded theories, complexity results,  Read more...


(not yet rated) 0 with reviews - Be the first.

More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Genre/Form: Conference papers and proceedings
Material Type: Conference publication, Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: E Börger
ISBN: 354055789X 9783540557890 9780387557892 038755789X
OCLC Number: 70314577
Description: viii, 428 pages ; 25 cm.
Contents: The expressive power of transitive closure and 2-way multihead automata.- Correctness proof for the WAM with types.- Model checking of persistent Petri nets.- Provability in TBLL: A decision procedure.- How to implement first order formulas in local memory machine models.- A new approach to abstract data types II computation on ADTs as ordinary computation.- A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation.- On bounded theories.- The cutting plane proof system with bounded degree of falsity.- Denotational versus declarative semantics for functional programming.- On transitive closure logic.- Some aspects of the probabilistic behavior of variants of resolution.- Safe queries in relational databases with functions.- Logical inference and polyhedral projection.- Stable logic.- A transformational methodology for proving termination of logic programs.- Plausibility logic.- Towards Kleene Algebra with recursion.- Equational specification of abstract types and combinators.- Normal forms in infinite-valued logic: The case of one variable.- A fragment of first order logic adequate for observation equivalence.- Ordinal processes in comparative concurrency semantics.- Logical semantics of modularisation.- A cut-elimination procedure designed for evaluating proofs as programs.- Minimal from classical proofs.- Quantifier hierarchies over word relations.- Complexity results for the default- and the autoepistemic logic.- On Completeness for NP via projection translations.- Control of ?-automata, Church's problem, and the emptiness problem for tree ?-automata.- Comparing the theory of representations and constructive mathematics.- Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic.- On completeness of program synthesis systems.- Proving termination for term rewriting systems.
Series Title: Lecture notes in computer science, 626.
Responsibility: E. Börger [and others] (eds.).
More information:


User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...


Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.