LCC 1994: Indianapolis, Indiana, USA

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

Last update Thu May 24 04:37:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page