Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This volume presents the proceedings of the workshop CSL '91
(Computer Science Logic) held at the University of Berne,
Switzerland, October 7-11, 1991. This was the fifth in a
series of annual workshops on computer sciencelogic (the
first four are recorded in LNCS volumes 329, 385, 440, and
533).
The volume contains 33 invited and selected papers on a
variety of logical topics in computer science, including
abstract datatypes, bounded theories, complexity results,
cut elimination, denotational semantics, infinitary queries,
Kleene algebra with recursion, minimal proofs, normal forms
in infinite-valued logic, ordinal processes, persistent
Petri nets, plausibility logic, program synthesis systems,
quantifier hierarchies, semantics of modularization, stable
logic, term rewriting systems, termination of logic
programs, transitive closure logic, variants of resolution,
and many others.
Similar content being viewed by others
Table of contents (33 papers)
-
Front Matter
Accessibility Information
Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.
Bibliographic Information
Book Title: Computer Science Logic
Book Subtitle: 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings
Editors: Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0023753
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1992
Softcover ISBN: 978-3-540-55789-0Published: 10 September 1992
eBook ISBN: 978-3-540-47285-8Published: 19 November 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 431
Topics: Theory of Computation, Mathematical Logic and Foundations, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices