InhaltsangabeCall-by-value games.- LISA: A specification language based on WS2S.- Evolution as a computational engine.- Timeless games.- From action calculi to linear logic.- A sequent calculus for circumscription.- Linear lower bounds and simulations in frege systems with substitutions.- A formulation of linear logic based on dependency-relations.- Resolution and the weak pigeonhole principle.- Higher-order matching and tree automata.- A proof-theoretical investigation of Zantema's problem.- Spectra with only unary function symbols.- Classical proofs via basic logic.- Canonization for Lk-equivalence is Hard.- Full abstractness for a functional/concurrent language with higher-order value-passing.- A duality theory for quantitative semantics.- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion.- Equational axioms of test algebra.- Mona & Fido: The logic-automaton connection in practice.- Existence of reduction hierarchies.- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion.- A conjunctive logical characterization of nondeterministic linear time.- On the computational complexity of type 2 functionals.- Categories with algebraic structure.- Concurrent constraint programming and non-commutative logic.- A hierarchical approach to monadic second-order logic over graphs.- The monadic quantifier alternation hierarchy over grids and pictures.- Padding and the expressive power of existential second-order logics.- Rich ?-words and monadic second-order arithmetic.- A simple ordinal recursive normalization of Gödel's T.

The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state of the art in the area.