LCC 1994: Indianapolis, Indiana, USA

Daniel Leivant (Ed.): Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, Indiana, USA, 13-16 October 1994. Lecture Notes in Computer Science 960 Springer 1995, ISBN 3-540-60178-3 BibTeX

@proceedings{DBLP:conf/lcc/1994,
  editor    = {Daniel Leivant},
  title     = {Logical and Computational Complexity. Selected Papers. Logic
               and Computational Complexity, International Workshop LCC '94,
               Indianapolis, Indiana, USA, 13-16 October 1994},
  booktitle = {LCC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {960},
  year      = {1995},
  isbn      = {3-540-60178-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Felice Cardone: Strict Finitism and Feasibility. 1-21 BibTeX
Rohit Parikh: Logical Omniscience. 22-29 BibTeX
Vladimir Yu. Sazonov: On Feasible Numbers. 30-51 BibTeX
Stephen A. Bloch: On Parallel Hierarchies and R_k^i. 52-76 BibTeX
Ulrich Berger, Helmut Schwichtenberg: Program Extraction from Classical Proofs. 77-97 BibTeX
Peter Clote: Computational Models and Function Algebras. 98-130 BibTeX
Robert L. Constable: Expressing Computational Complexity in Constructive Type Theory. 131-144 BibTeX
Jean-Yves Girard: Light Linear Logic. 145-176 BibTeX
Daniel Leivant: Intrinsic Theories and Computational Complexity. 177-194 BibTeX
Samuel R. Buss: On Herbrand's Theorem. 195-209 BibTeX
Jan Krajícek, Pavel Pudlák: Some Consequences of Cryptographical Conjectures for S_2^1 and EF. 210-220 BibTeX
Gaisi Takeuti: Frege Proof System and TNC°. 221-252 BibTeX
Stephen Bellantoni: Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length. 253-268 BibTeX
Anil Seth: Type 2 Polynomial Hierarchies. 269-280 BibTeX
Stanley S. Wainer: The Hierarchy of terminating Recursive Programs over N. 281-299 BibTeX
Douglas A. Cenzer, Jeffrey B. Remmel: Feasibly Categorial Models. 300-312 BibTeX
Erich Grädel, Yuri Gurevich: Metafinite Model Theory. 313-366 BibTeX
Bakhadyr Khoussainov, Anil Nerode: Automatic Presentations of Structures. 367-392 BibTeX
Anuj Dawar: A Restricted Second Order Logic for Finite Structures. 393-413 BibTeX
Ronald Fagin: Comparing the Power of Monadic NP Games. 414-425 BibTeX
Stéphane Grumbach, Jianwen Su, Christophe Tollu: Linear Constraint Query Languages: Expressive Power and Complexity. 426-446 BibTeX
Steven Lindell: A Constant-Space Sequential Model of Computation for First-Order Logic. 447-462 BibTeX
Johann A. Makowsky, Y. B. Pnueli: Logics Capturing Relativized Complexity Classes Uniformly. 463-479 BibTeX
Eric Rosen, Scott Weinstein: Preservation Theorems in Finite Model Theory. 480-502 BibTeX
Dan Suciu, Val Tannen: A Query Language for NC. 503-514 BibTeX