| Topological Semantics for Hybrid Systems | p. 1 |
| Domain-Free Pure Type Systems | p. 9 |
| Generic Queries over Quasi-o-minimal Domains | p. 21 |
| Towards Computing Distances Between Programs via Scott Domains | p. 33 |
| A Safe Recursion Scheme for Exponential Time | p. 44 |
| Finite Model Theory, Universal Algebra and Graph Grammars | p. 53 |
| Complexity of Query Answering in Logic Databases with Complex Values | p. 56 |
| Recognition of Deductive Data Base Stability | p. 67 |
| The Concurrency Complexity for the Horn Fragment of Linear Logic | p. 78 |
| Studying Algorithmic Problems for Free Semi-groups and Groups | p. 88 |
| Learning Small Programs with Additional Information | p. 102 |
| Cut Elimination for the Second Order Propositional Logic with Hilbert's [epsilon]-symbol, Extensionality, and Full Comprehension | p. 113 |
| Finite Bases of Admissible Rules for the Logic S5[subscript 2]C | p. 119 |
| An Algebraic Correctness Criterion for Intuitionistic Proof-Nets | p. 130 |
| Towards a Theory of Recursive Structures | p. 141 |
| On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces | p. 145 |
| The Undecidability of Second Order Linear Affine Logic | p. 156 |
| Operational Logic of Proofs with Functionality Condition on Proof Predicate | p. 167 |
| On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets | p. 178 |
| Functions for the General Solution of Parametric Word Equations | p. 189 |
| A Proof Procedure for Hereditary Harrop Formulas with Free Equality | p. 203 |
| Basic Forward Chaining Construction for Logic Programs | p. 214 |
| Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey | p. 226 |
| Case Study: Additive Linear Logic and Lattices | p. 237 |
| Some Decision Problems for Traces | p. 248 |
| Existential Instantiation and Strong Normalization | p. 258 |
| Models for the Logic of Proofs | p. 266 |
| Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences | p. 276 |
| Type Introduction for Equational Rewriting | p. 283 |
| Capturing Bisimulation-Invariant PTIME | p. 294 |
| Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic | p. 306 |
| A Decidable Fragments of Second Order Linear Logic | p. 312 |
| Some Results on Propositional Dynamic Logic with Fixed Points | p. 323 |
| Quasi-Characteristic Inference Rules for Modal Logics | p. 333 |
| Provability Logic with Operations on Proofs | p. 342 |
| Formal Verification of Logic Programs: Foundations and Implementation | p. 354 |
| Unification of Terms with Term-Indexed Variables | p. 369 |
| Back-Forth Equivalences for Design of Concurrent Systems | p. 374 |
| Association Nets: An Alternative Formalization of Common Thinking | p. 385 |
| Simulating [eta]-expansions with [beta]-reductions in the Second-Order Polymorphic [lambda]-calculus | p. 399 |
| Logical Schemes for First Order Theories | p. 410 |
| Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms | p. 419 |
| List of Authors | p. 431 |
| Table of Contents provided by Blackwell. All Rights Reserved. |