Computer Science Logic

Egon Börger

ISBN 10: 354055789X / ISBN 13: 9783540557890

Published by Springer, Springer Sep 1992, 1992

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -This volume presents the proceedings of the workshop CSL '91(Computer Science Logic) held at the University of BerneSwitzerland, October 7-11, 1991. This was the fifth in aseries of annual workshops on computer sciencelogic (thefirst four are recorded in LNCS volumes 329, 385, 440, and533).The volume contains 33 invited and selected papers on avariety of logical topics in computer science, includingabstract datatypes, bounded theories, complexity resultscut elimination, denotational semantics, infinitary queriesKleene algebra with recursion, minimal proofs, normal formsin infinite-valued logic, ordinal processes, persistentPetri nets, plausibility logic, program synthesis systemsquantifier hierarchies, semantics of modularization, stablelogic, term rewriting systems, termination of logicprograms, transitive closure logic, variants of resolutionand many others.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 440 pp. Englisch.

Seller Inventory # 9783540557890

Bibliographic Details

• Title: Computer Science Logic
• Publisher: Springer, Springer Sep 1992
• Publication Date: 1992
• Language: English
• ISBN 10: 354055789X
• ISBN 13: 9783540557890
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 24D millimeters 235 millimeters width by 155 millimeters height by 24 millimeters depth
• Weight: 663 grams

About this title

Synopsis

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.