Research Catalog
Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers
- Title
- Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers / Daniel Leivant (ed.).
- Publication
- Berlin ; New York : Springer, ©1995.
Items in the Library & Off-site
Filter by
1 Item
| Status | Format | Access | Call Number | Item Location |
|---|---|---|---|---|
| Book/Text | Use in library | QA9.A1 L625 1995 | Off-site |
Details
- Additional Authors
- Leivant, Daniel Maurice Raphaël.
- Description
- viii, 514 pages : illustrations; 24 cm
- Series Statement
- Lecture notes in computer science ; 960
- Uniform Title
- Lecture notes in computer science ; 960.
- Subject
- Logic, Symbolic and mathematical > Congresses
- Computational complexity > Congresses
- Computational complexity
- Logic, Symbolic and mathematical
- Berechnungskomplexität
- Berechnungstheorie
- Beweistheorie
- Datenverarbeitung
- Komplexität
- Komplexitätstheorie
- Logik
- Mathematische Logik
- Logica
- Complexiteit
- Logique mathématique
- Complexité de calcul (informatique)
- Indianapolis <Ind., 1994>
- Genre/Form
- Conference papers and proceedings.
- Indianapolis (Ind., 1994)
- Bibliography (note)
- Includes bibliographical references.
- Contents
- 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.
- ISBN
- 3540601783
- 9783540601784
- LCCN
- 95037560
- OCLC
- ocm32970065
- 32970065
- SCSB-9151603
- Owning Institutions
- Princeton University Library