Logic and Computational Complexity [electronic resource] : International Workshop LCC'94 Indianapolis, IN, USA, October 13–16, 1994 Selected Papers / edited by Daniel Leivant.

Strict finitism and feasibility -- Logical omniscience -- On feasible numbers -- On parallel hierarchies and R k i -- Program extraction from classical proofs -- Computation models and function algebras -- Expressing computational complexity in constructive type theory -- Light linear logic -- Intrinsic theories and computational complexity -- On Herbrand's theorem -- Some consequences of cryptographical conjectures for S 2 1 and EF -- Frege proof system and TNC° -- Characterizing parallel time by type 2 recursions with polynomial output length -- Type 2 polynomial hierarchies -- The hierarchy of terminating recursive programs over N -- Feasibly categorical models -- Metafinite model theory -- Automatic presentations of structures -- A restricted second order logic for finite structures -- Comparing the power of monadic NP games -- Linear constraint query languages expressive power and complexity -- A constant-space sequential model of computation for first-order logic -- Logics capturing relativized complexity classes uniformly -- Preservation theorems in finite model theory -- A query language for NC (extended abstract).

This book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994. The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory.