Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Logic and Computational Complexity - International Workshop, LCC '94, Indianapolis, IN, USA, October

Logic and Computational Complexity

International Workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers

Leivant, Daniel (Ed.)

1995, VIII, 520 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


ISBN 978-3-540-44720-7

digitally watermarked, no DRM

The eBook version of this title will be available soon

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-60178-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

This book contains revised versions of papers invited for presentation at the International Workshop on Logic and Computational Complexity, LCC '94, held in Indianapolis, IN in October 1994.
The synergy between logic and computational complexity has gained importance and vigor in recent years, cutting across many areas. The 25 revised full papers in this book contributed by internationally outstanding researchers document the state-of-the-art in this interdisciplinary field of growing interest; they are presented in sections on foundational issues, applicative and proof-theoretic complexity, complexity of proofs, computational complexity of functionals, complexity and model theory, and finite model theory.

Content Level » Research

Keywords » Algorithmische Komplexität - Applicative Complexity - Applikative Komplexität - Beweistheoretische Komplexität - Beweistheorie - Computational Complexity - Model Theory - Modelltheorie - Proof Theory - Proof-Theoretic Complexity - complexity - logic

Related subjects » Mathematics - Theoretical Computer Science

Table of contents 

Strict finitism and feasibility.- Logical omniscience.- On feasible numbers.- On parallel hierarchies and R k i .- Program extraction from classical proofs.- Computation models and function algebras.- Expressing computational complexity in constructive type theory.- Light linear logic.- Intrinsic theories and computational complexity.- On Herbrand's theorem.- Some consequences of cryptographical conjectures for S 2 1 and EF.- Frege proof system and TNC°.- Characterizing parallel time by type 2 recursions with polynomial output length.- Type 2 polynomial hierarchies.- The hierarchy of terminating recursive programs over N.- Feasibly categorical models.- Metafinite model theory.- Automatic presentations of structures.- A restricted second order logic for finite structures.- Comparing the power of monadic NP games.- Linear constraint query languages expressive power and complexity.- A constant-space sequential model of computation for first-order logic.- Logics capturing relativized complexity classes uniformly.- Preservation theorems in finite model theory.- A query language for NC (extended abstract).

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematics of Computing.