16. CSL 2002: Edinburgh, Scotland, UK
Julian C. Bradfield (Ed.): Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings. Springer 2002 Lecture Notes in Computer Science ISBN 3-540-44240-5
Invited Lectures
- Frank Neven: Automata, Logic, and XML. 2-26
- Damian Niwinski: µ-Calculus via Games. 27-43
Rewriting and Constructive Mathematics
- Max I. Kanovich: Bijections between Partitions by Two-Directional Rewriting Techniques. 44-58
- Alexey V. Chernov, Dmitrij P. Skvortsov, Elena Z. Skvortsova, Nikolai K. Vereshchagin: Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle. 74-88
- Douglas S. Bridges, Hajime Ishihara, Peter Schuster: Compactness and Continuity, Constructively Revisited. 89-102
Fixpoints and Recursion
- Tobias Nipkow: Hoare Logics for Recursive Procedures and Unbounded Nondeterminism. 103-119
- Yifeng Chen: A Fixpoint Theory for Non-monotonic Parallelism. 120-134
Linear and Resource Logics
- Joshua S. Hodas, Pablo López, Jeffrey Polakow, Lubomira Stoilova, Ernesto Pimentel: A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming. 167-182
Semantics
- Pietro Cenciarelli: Configuration Theories. 200-215
- Paul Blain Levy: Possible World Semantics for General Storage in Call-By-Value. 232-246
- Guy McCusker: A Fully Abstract Relational Model of Syntactic Control of Interference. 247-261
Temporal Logics and Games
- Antonín Kucera, Jan Strejcek: The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. 276-291
Probability, Games and Fixpoints
- Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko: A Logic of Probability with Decidable Model-Checking. 306-321
- Thierry Cachat, Jacques Duparc, Wolfgang Thomas: Solving Pushdown Games with a Sigma3 Winning Condition. 322-336
- Stephan Kreutzer: Partial Fixed-Point Logic on Infinite Structures. 337-351
- Dietmar Berwanger, Erich Grädel, Giacomo Lenzi: On the Variable Hierarchy of the Modal µ-Calculus. 352-366
Complexity and Proof Complexity
- Daniel Leivant: Implicit Computational Complexity for Higher Type Functionals. 367-381
- Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. 412-426
Ludics and Linear Logic
- Claudia Faggian: Travelling on Designs. 427-441
- Masahito Hasegawa: Classical Linear Logic of Implications. 458-472
Lambda-Calculi
- Jean Goubault-Larrecq: Higher-Order Positive Set Constraints. 473-489
- Ichiro Ogata: A Proof Theoretical Account of Continuation Passing Style. 490-505
- Yoshihiko Kakutani: Duality between Call-by-Name Recursion and Call-by-Value Iteration. 506-521
- Herman Geuvers, Gueorgui I. Jojgov: Open Proofs and Open Terms: A Basis for Interactive Logic. 537-552
Resolution and Proofs
- Albert Atserias, Maria Luisa Bonet: On the Automatizability of Resolution and Related Propositional Proof Systems. 569-583
- Hans de Nivelle: Extraction of Proofs from the Clausal Normal Form Transformation. 584-598
- Arnold Beckmann: Resolution Refutations and Propositional Proofs with Height-Restrictions. 599-612
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team