Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=960

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Strict finitism and feasibility
Felice Cardone
Lecture Notes in Computer Science 960, 1995, pp. 1-21
Logical omniscience
Rohit Parikh
Lecture Notes in Computer Science 960, 1995, pp. 22-29
On feasible numbers
Vladimir Yu. Sazonov
Lecture Notes in Computer Science 960, 1995, pp. 30-51
On parallel hierarchies and R_k^i
Stephen Bloch
Lecture Notes in Computer Science 960, 1995, pp. 52-76
Program extraction from classical proofs
Ulrich Berger, Helmut Schwichtenberg
Lecture Notes in Computer Science 960, 1995, pp. 77-97
Computational models and function algebras
Peter Clote
Lecture Notes in Computer Science 960, 1995, pp. 98-130
Expressing computational complexity in constructive type theory
Robert L. Constable
Lecture Notes in Computer Science 960, 1995, pp. 131-144
Light linear logic
Jean-Yves Girard
Lecture Notes in Computer Science 960, 1995, pp. 145-176
Intrinsic theories and computational complexity
Daniel Leivant
Lecture Notes in Computer Science 960, 1995, pp. 177-194
On Herbrand's theorem
Samuel R. Buss
Lecture Notes in Computer Science 960, 1995, pp. 195-209
Some consequences of cryptographical conjectures for S_2^1 and EF
Jan Krajíc̑ek, Pavel Pudlák
Lecture Notes in Computer Science 960, 1995, pp. 210-220
Frege proof system and TNC^o
Gaisi Takeuti
Lecture Notes in Computer Science 960, 1995, pp. 221-252
Characterizing parallel time by type 2 recursions with polynomial output length
Stephen J. Bellantoni
Lecture Notes in Computer Science 960, 1995, pp. 253-268
Type 2 polynomial hierarchies
Anil Seth
Lecture Notes in Computer Science 960, 1995, pp. 269-280
The hierarchy of terminating recursive programs over N
Stanley S. Wainer
Lecture Notes in Computer Science 960, 1995, pp. 281-299
Feasibly categorical models
Douglas Cenzer, Jeffrey B. Remmel
Lecture Notes in Computer Science 960, 1995, pp. 300-312
Metafinite model theory
Erich Grädel, Yuri Gurevich
Lecture Notes in Computer Science 960, 1995, pp. 313-366
Automatic presentations of structures
Bakhadyr Khoussainov, Anil Nerode
Lecture Notes in Computer Science 960, 1995, pp. 367-392
A restricted second order logic for finite structures
Anuj Dawar
Lecture Notes in Computer Science 960, 1995, pp. 393-413
Comparing the power of monadic NP games
Ronald Fagin
Lecture Notes in Computer Science 960, 1995, pp. 414-425
Linear constraint query languages: Expressive power and complexity
Stéphane Grumbach, Jianwen Su, Christophe Tollu
Lecture Notes in Computer Science 960, 1995, pp. 426-446
A constant-space sequential model of computation for first-order logic
Steven Lindell
Lecture Notes in Computer Science 960, 1995, pp. 447-462
Logics capturing relativized complexity classes uniformly
J.A. Makowsky, Y.B. Pnueli
Lecture Notes in Computer Science 960, 1995, pp. 463-479
Preservation theorems in finite model theory
Eric Rosen, Scott Weinstein
Lecture Notes in Computer Science 960, 1995, pp. 480-502
A query language for NC
Dan Suciu, Val Breazu-Tannen
Lecture Notes in Computer Science 960, 1995, pp. 503-514