| 2001 | Capture Complexity by Partition. | Yijia Chen, Enshao Shen |
| 2001 | The Decidability of Model Checking Mobile Ambients. | Witold Charatonik, Jean-Marc Talbot |
| 2001 | Applications of Alfred Tarski's Ideas in Database Theory. | Jan Van den Bussche |
| 2001 | Decidable Navigation Logics for Object Structures. | Frank S. de Boer, Rogier M. van Eijk |
| 2001 | An Improved Extensionality Criterion for Higher-Order Logic Programs. | Marc Bezem |
| 2001 | On a Generalisation of Herbrand's Theorem. | Matthias Baaz, Georg Moser |
| 2001 | Uniform Derivation of Decision Procedures by Superposition. | Alessandro Armando, Silvio Ranise, Michal Rusinowitch |
| 2001 | Categorical and Kripke Semantics for Constructive S4 Modal Logic. | Natasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter |
| 2001 | Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic. | Yohji Akama |
| 2001 | Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. | Samson Abramsky, Marina Lenisa |
| 2000 | On the Logic of the Standard Proof Predicate. | Rostislav E. Yavorsky |
| 2000 | Automated Verification = Graphs, Automata, and Logic. | Moshe Y. Vardi |
| 2000 | Schema Revisited. | Colin Stirling |
| 2000 | Choiceless Polynominal Time Logic: Inability to Express. | Saharon Shelah |
| 2000 | Elementary Choiceless Constructive Analysis. | Peter M. Schuster |
| 2000 | Translating Theory into Practice - Abstract State Machines within Microsoft. | Wolfram Schulte |
| 2000 | Logical Relations and Data Abstraction. | John Power, Edmund Robinson |
| 2000 | Une tentative malheureuse do construire une structure liminant rapidement les quanteurs. | Bruno Poizat |
| 2000 | From Programs to Games: Invariance and Safety for Bisimulation. | Marc Pauly |
| 2000 | On the Computational Interpretation of Negation. | Michel Parigot |
| 2000 | Equational Termination by Semantic Labelling. | Hitoshi Ohsaki, Aart Middeldorp, Jrgen Giesl |
| 2000 | Completeness of Higher-Order Duration Calculus. | Naijun Zhan |
| 2000 | Discreet Games, Light Affine Logic and PTIME Computation. | Andrzej S. Murawski, C.-H. Luke Ong |
| 2000 | Elimination of Negation in a Logical Framework. | Alberto Momigliano |
| 2000 | On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. | Johann A. Makowsky, Klaus Meer |