Conferences in DBLP

Logical and Computational Complexity (LCC) (lcc)
1994 (conf/lcc/1994)

1. Felice Cardone
   Strict Finitism and Feasibility. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:1-21 [Conf]
   
2. Rohit Parikh
   Logical Omniscience. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:22-29 [Conf]
   
3. Vladimir Yu. Sazonov
   On Feasible Numbers. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:30-51 [Conf]
   
4. Stephen A. Bloch
   On Parallel Hierarchies and R_k^i. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:52-76 [Conf]
   
5. Ulrich Berger, Helmut Schwichtenberg
   Program Extraction from Classical Proofs. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:77-97 [Conf]
   
6. Peter Clote
   Computational Models and Function Algebras. [Citation Graph (1, 0)][DBLP]
   LCC, 1994, pp:98-130 [Conf]
   
7. Robert L. Constable
   Expressing Computational Complexity in Constructive Type Theory. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:131-144 [Conf]
   
8. Jean-Yves Girard
   Light Linear Logic. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:145-176 [Conf]
   
9. Daniel Leivant
   Intrinsic Theories and Computational Complexity. [Citation Graph (0, 0)][DBLP]
   LCC, 1994, pp:177-194 [Conf]
   
10. Samuel R. Buss
    On Herbrand's Theorem. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:195-209 [Conf]
    
11. 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:210-220 [Conf]
    
12. Gaisi Takeuti
    Frege Proof System and TNC°. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:221-252 [Conf]
    
13. Stephen Bellantoni
    Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:253-268 [Conf]
    
14. Anil Seth
    Type 2 Polynomial Hierarchies. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:269-280 [Conf]
    
15. Stanley S. Wainer
    The Hierarchy of terminating Recursive Programs over N. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:281-299 [Conf]
    
16. Douglas A. Cenzer, Jeffrey B. Remmel
    Feasibly Categorial Models. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:300-312 [Conf]
    
17. Erich Grädel, Yuri Gurevich
    Metafinite Model Theory. [Citation Graph (4, 0)][DBLP]
    LCC, 1994, pp:313-366 [Conf]
    
18. Bakhadyr Khoussainov, Anil Nerode
    Automatic Presentations of Structures. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:367-392 [Conf]
    
19. Anuj Dawar
    A Restricted Second Order Logic for Finite Structures. [Citation Graph (1, 0)][DBLP]
    LCC, 1994, pp:393-413 [Conf]
    
20. Ronald Fagin
    Comparing the Power of Monadic NP Games. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:414-425 [Conf]
    
21. Stéphane Grumbach, Jianwen Su, Christophe Tollu
    Linear Constraint Query Languages: Expressive Power and Complexity. [Citation Graph (16, 0)][DBLP]
    LCC, 1994, pp:426-446 [Conf]
    
22. Steven Lindell
    A Constant-Space Sequential Model of Computation for First-Order Logic. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:447-462 [Conf]
    
23. Johann A. Makowsky, Y. B. Pnueli
    Logics Capturing Relativized Complexity Classes Uniformly. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:463-479 [Conf]
    
24. Eric Rosen, Scott Weinstein
    Preservation Theorems in Finite Model Theory. [Citation Graph (1, 0)][DBLP]
    LCC, 1994, pp:480-502 [Conf]
    
25. Dan Suciu, Val Tannen
    A Query Language for NC. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:503-514 [Conf]