Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers

Title
  1. Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers / Daniel Leivant (ed.).
Published by
  1. Berlin ; New York : Springer, ©1995.

Items in the library and off-site

Filter by

Displaying 1 item

StatusFormatAccessCall numberItem location
StatusFormatTextAccessUse in libraryCall numberQA9.A1 L625 1995Item locationOff-site

Details

Additional authors
  1. Leivant, Daniel Maurice Raphaël.
Description
  1. viii, 514 pages : illustrations; 24 cm
Series statement
  1. Lecture notes in computer science ; 960
Uniform title
  1. Lecture notes in computer science ; 960.
Subject
  1. Logic, Symbolic and mathematical > Congresses
  2. Computational complexity > Congresses
  3. Computational complexity
  4. Logic, Symbolic and mathematical
  5. Berechnungskomplexität
  6. Berechnungstheorie
  7. Beweistheorie
  8. Datenverarbeitung
  9. Komplexität
  10. Komplexitätstheorie
  11. Logik
  12. Mathematische Logik
  13. Logica
  14. Complexiteit
  15. Logique mathématique
  16. Complexité de calcul (informatique)
  17. Indianapolis <Ind., 1994>
Genre/Form
  1. Conference papers and proceedings.
  2. Indianapolis (Ind., 1994)
Contents
  1. Strict finitism and feasibility / Felice Cardone -- Logical omniscience / Rohit Parikh -- On feasible numbers / Vladimir Yu. Sazonov -- On parallel hierarchies and R[i over k] / Stephen Bloch -- Program extraction from classical proofs / Ulrich Berger and Helmut Schwichtenberg -- Computational models and function algebras / Peter Clote -- Expressing computational complexity in constructive type theory / Robert L. Constable -- Light linear logic / Jean-Yves Girard -- Intrinsic theories and computational complexity / Daniel Leivant -- On Herbrand's theorem / Samuel R. Buss -- Some consequences of cryptographical conjectures for S1/2 and EF / Jan Krajíček and Pavel Pudlák -- Frege proof system and TNC[superscript]̊ / Gaisi Takeuti -- Characterizing parallel time by type 2 recursions with polynomial output length / Stephen J. Bellantoni -- Type 2 polynomial hierarchies / Anil Seth -- The hierarchy of terminating recursive programs over N / Stanley S. Wainer -- Feasibly categorical models / Douglas Cenzer and Jeffrey B. Remmel -- Metafinite model theory / Erich Grädel and Yuri Gurevich -- Automatic presentations of structures / Bakhadyr Khoussainov and Anil Nerode -- A restricted second order logic for finite structures / Anuj Dawar -- Comparing the power of monadic NP games / Ronald Fagin -- Linear constraint query languages : expressive power and complexity / Stéphane Grumbach, Jianwen Su, and Christophe Tollu -- A constant-space sequential model of computation for first-order logic / Steven Lindell -- Logics capturing relativized complexity classes uniformly / J.A. Makowsky and Y.B. Pnueli -- Preservations theorems in finite model theory / Eric Rosen and Scott Weinstein -- A query language for NC / Dan Suciu and Val Breazu-Tannen.
Owning institution
  1. Princeton University Library
Bibliography (note)
  1. Includes bibliographical references.