default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th CSL 2002: Edinburgh, Scotland, UK
- Julian C. Bradfield:
Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings. Lecture Notes in Computer Science 2471, Springer 2002, ISBN 3-540-44240-5
Invited Lectures
- Susumu Hayashi, Yohji Akama:
Limit-Computable Mathematics and Its Applications. 1 - 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 - Klaus Aehlig, Felix Joachimski:
On Continuous Normalization. 59-73 - 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 - Zoltán Ésik, Hans Leiß:
Greibach Normal Form in Algebraically Complete Semirings. 135-150
Linear and Resource Logics
- Harry G. Mairson, Xavier Rival:
Proofnets and Context Semantics for the Additives. 151-166 - 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 - Didier Galmiche, Daniel Méry, David J. Pym:
Resource Tableaux. 183-199
Semantics
- Pietro Cenciarelli:
Configuration Theories. 200-215 - M. Andrew Moshier, Achim Jung:
A Logic for Probabilities in Semantics. 216-231 - 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
- Jerzy Marcinkowski, Tomasz Truderung:
Optimal Complexity Bounds for Positive LTL Games. 262-275 - Antonín Kucera, Jan Strejcek:
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. 276-291 - Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger:
Trading Probability for Fairness. 292-305
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 - Matthias Baaz, Georg Moser:
On Generalizations of Semi-terms of Particularly Simple Form. 382-396 - Régis Barbanchon, Etienne Grandjean:
Local Problems, Planar Local Problems and Linear Time. 397-411 - 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 - Claudia Faggian, Martin Hyland:
Designs, Disputes and Strategies. 442-457 - 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 - Manfred Schmidt-Schauß, Klaus U. Schulz:
Decidability of Bounded Higher-Order Unification. 522-536 - Herman Geuvers, Gueorgui I. Jojgov:
Open Proofs and Open Terms: A Basis for Interactive Logic. 537-552 - Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical Relations for Monadic Types. 553-568
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-17 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
