Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)

Resource Information

The instance Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.) represents a material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Instance, Electronic.

Image

http://images.btol.com/ContentCafe/Jacket.aspx?UserID=ebsco-test&Password=ebsco-test&Return=T&Value=9783540447207&Type=L

Label

Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers, Daniel Leivant (ed.)

Title remainder

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

Statement of responsibility

Daniel Leivant (ed.)

Instantiates

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

Publication

• Berlin | New York, Springer, ©1995

Bibliography note

Includes bibliographical references

Carrier category

online resource

Carrier category code

• cr

Carrier MARC source

rdacarrier

Content category

text

Content type code

• txt

Content type MARC source

rdacontent

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

Control code

326709497

Dimensions

unknown

Extent

1 online resource (viii, 514 pages)

Form of item

online

Isbn

9783540447207

Media category

computer

Media MARC source

rdamedia

Media type code

• c

Other control number

10.1007/3-540-60178-3

Other physical details

illustrations.

Record ID

.b13010677x

Sound

unknown sound

Specific material designation

remote

System control number

(OCoLC)326709497