
Conferences in DBLP
 Felice Cardone
Strict Finitism and Feasibility. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:121 [Conf]
 Rohit Parikh
Logical Omniscience. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:2229 [Conf]
 Vladimir Yu. Sazonov
On Feasible Numbers. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:3051 [Conf]
 Stephen A. Bloch
On Parallel Hierarchies and R_k^i. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:5276 [Conf]
 Ulrich Berger, Helmut Schwichtenberg
Program Extraction from Classical Proofs. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:7797 [Conf]
 Peter Clote
Computational Models and Function Algebras. [Citation Graph (1, 0)][DBLP] LCC, 1994, pp:98130 [Conf]
 Robert L. Constable
Expressing Computational Complexity in Constructive Type Theory. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:131144 [Conf]
 JeanYves Girard
Light Linear Logic. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:145176 [Conf]
 Daniel Leivant
Intrinsic Theories and Computational Complexity. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:177194 [Conf]
 Samuel R. Buss
On Herbrand's Theorem. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:195209 [Conf]
 Jan Krajícek, Pavel Pudlák
Some Consequences of Cryptographical Conjectures for S_2^1 and EF. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:210220 [Conf]
 Gaisi Takeuti
Frege Proof System and TNC°. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:221252 [Conf]
 Stephen Bellantoni
Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:253268 [Conf]
 Anil Seth
Type 2 Polynomial Hierarchies. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:269280 [Conf]
 Stanley S. Wainer
The Hierarchy of terminating Recursive Programs over N. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:281299 [Conf]
 Douglas A. Cenzer, Jeffrey B. Remmel
Feasibly Categorial Models. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:300312 [Conf]
 Erich Grädel, Yuri Gurevich
Metafinite Model Theory. [Citation Graph (4, 0)][DBLP] LCC, 1994, pp:313366 [Conf]
 Bakhadyr Khoussainov, Anil Nerode
Automatic Presentations of Structures. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:367392 [Conf]
 Anuj Dawar
A Restricted Second Order Logic for Finite Structures. [Citation Graph (1, 0)][DBLP] LCC, 1994, pp:393413 [Conf]
 Ronald Fagin
Comparing the Power of Monadic NP Games. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:414425 [Conf]
 Stéphane Grumbach, Jianwen Su, Christophe Tollu
Linear Constraint Query Languages: Expressive Power and Complexity. [Citation Graph (16, 0)][DBLP] LCC, 1994, pp:426446 [Conf]
 Steven Lindell
A ConstantSpace Sequential Model of Computation for FirstOrder Logic. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:447462 [Conf]
 Johann A. Makowsky, Y. B. Pnueli
Logics Capturing Relativized Complexity Classes Uniformly. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:463479 [Conf]
 Eric Rosen, Scott Weinstein
Preservation Theorems in Finite Model Theory. [Citation Graph (1, 0)][DBLP] LCC, 1994, pp:480502 [Conf]
 Dan Suciu, Val Tannen
A Query Language for NC. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:503514 [Conf]
