Logic and Computational Complexity: International Workshop, LCC '94, Indianapolis, In, USA, October 13-16, 1994. Selected Papers (Paperback, 1995)

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).