Computer Science Logic - Info and Reading Options
15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings (Lecture Notes in Computer Science)
By Laurent Fribourg

"Computer Science Logic" was published by Springer in October 2, 2001, it has 615 pages and the language of the book is English.
“Computer Science Logic” Metadata:
- Title: Computer Science Logic
- Author: Laurent Fribourg
- Language: English
- Number of Pages: 615
- Publisher: Springer
- Publish Date: October 2, 2001
“Computer Science Logic” Subjects and Themes:
- Subjects: Computer logic - Congresses
Edition Specifications:
- Format: Paperback
- Weight: 2.2 pounds
- Dimensions: 9.1 x 6.1 x 1.4 inches
Edition Identifiers:
- The Open Library ID: OL9533296M - OL9217247W
- Library of Congress Control Number (LCCN): 2001049477
- ISBN-13: 9783540425540
- ISBN-10: 3540425543
- All ISBNs: 3540425543 - 9783540425540
AI-generated Review of “Computer Science Logic”:
"Computer Science Logic" Description:
The Open Library:
Computer Science Logic: 15th International Workshop, CSL 2001 10th Annual Conference of the EACSL Paris, France, September 10–13, 2001, Proceedings<br />Author: Laurent Fribourg<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42554-0<br /> DOI: 10.1007/3-540-44802-0<br /><br />Table of Contents:<p></p><ul><li>Local Reasoning about Programs that Alter Data Structures </li><li>Applications of Alfred Tarski’s Ideas in Database Theory </li><li>Locus Solum: From the Rules of Logic to the Logic of Rules </li><li>The Expressive Power of Horn Monadic Linear Logic </li><li>Non-commutativity and MELL in the Calculus of Structures </li><li>Quadratic Correctness Criterion for Non-commutative Logic </li><li>Capture Complexity by Partition </li><li>An Existential Locality Theorem </li><li>Actual Arithmetic and Feasibility </li><li>The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group </li><li>An Algebraic Foundation for Higraphs </li><li>Semantic Characterisations of Second-Order Computability over the Real Numbers </li><li>An Abstract Look at Realizability </li><li>The Anatomy of Innocence </li><li>An Improved Extensionality Criterion for Higher-Order Logic Programs </li><li>A Logic for Abstract State Machines </li><li>Constrained Hyper Tableaux </li><li>Modal Logic and the Two-Variable Fragment </li><li>A Logic for Approximate First-Order Reasoning </li><li>Inflationary Fixed Points in Modal Logic</li></ul>
Read “Computer Science Logic”:
Read “Computer Science Logic” by choosing from the options below.
Search for “Computer Science Logic” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Computer Science Logic" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “Computer Science Logic” in Libraries Near You:
Read or borrow “Computer Science Logic” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Computer Science Logic” at a library near you.
Buy “Computer Science Logic” online:
Shop for “Computer Science Logic” on popular online marketplaces.
- Ebay: New and used books.