Computer Science Logic

Computer Science Logic: 15th International Workshop, CSL 2001 10th Annual Conference of the EACSL Paris, France, September 10–13, 2001, Proceedings
Author: Laurent Fribourg
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42554-0
DOI: 10.1007/3-540-44802-0

Table of Contents:

• Local Reasoning about Programs that Alter Data Structures
• Applications of Alfred Tarski’s Ideas in Database Theory
• Locus Solum: From the Rules of Logic to the Logic of Rules
• The Expressive Power of Horn Monadic Linear Logic
• Non-commutativity and MELL in the Calculus of Structures
• Quadratic Correctness Criterion for Non-commutative Logic
• Capture Complexity by Partition
• An Existential Locality Theorem
• Actual Arithmetic and Feasibility
• The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group
• An Algebraic Foundation for Higraphs
• Semantic Characterisations of Second-Order Computability over the Real Numbers
• An Abstract Look at Realizability
• The Anatomy of Innocence
• An Improved Extensionality Criterion for Higher-Order Logic Programs
• A Logic for Abstract State Machines
• Constrained Hyper Tableaux
• Modal Logic and the Two-Variable Fragment
• A Logic for Approximate First-Order Reasoning
• Inflationary Fixed Points in Modal Logic