Logic and Computational Complexity Book

	Strict Finitism and Feasibility	1
	Logical Omniscience	22
	On Feasible Numbers	30
	On Parallel Hierarchies and [actual symbol not reproducible]	52
	Program Extraction from Classical Proofs	77
	Computational Models and Function Algebras	98
	Expressing Computational Complexity in Constructive Type Theory	131
	Light Linear Logic	145
	Intrinsic Theories and Computational Complexity	177
	On Herbrand's Theorem	195
	Some Consequences of Cryptographical Conjectures for [actual symbol not reproducible] and EF	210
	Frege Proof System and [actual symbol not reproducible]	221
	Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length	253
	Type 2 Polynomial Hierarchies	269
	The Hierarchy of Terminating Recursive Programs over N	281
	Feasibly Categorical Models	300
	Metafinite Model Theory	313
	Automatic Presentations of Structures	367
	A Restricted Second Order Logic for Finite Structures	393
	Comparing the Power of Monadic NP Games	414
	Linear Constraint Query Languages: Expressive Power and Complexity	426
	A Constant-Space Sequential Model of Computation for First-Order Logic	447
	Logics Capturing Relativized Complexity Classes Uniformly	463
	Preservation Theorems in Finite Model Theory	480
	A Query Language for NC	503