Journals in DBLP

Theor. Comput. Sci.
2000, volume: 232, number: 1-2

1. Didier Galmiche, David J. Pym
   Proof-search in type-theoretic languages: an introduction. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:5-53 [Journal]
   
2. James L. Caldwell, Ian P. Gent, Judith L. Underwood
   Search algorithms in type theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:55-90 [Journal]
   
3. Raymond McDowell, Dale Miller
   Cut-elimination for a logic with definitions and induction. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:91-119 [Journal]
   
4. Toshiyasu Arai, Grigori Mints
   Extended normal form theorems for logical proofs from axioms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:121-132 [Journal]
   
5. Iliano Cervesato, Joshua S. Hodas, Frank Pfenning
   Efficient resource management for linear logic proof search. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:133-163 [Journal]
   
6. Martin W. Bunder
   Proof finding algorithms for implicational logics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:165-186 [Journal]
   
7. Amy P. Felty
   The calculus of constructions as a framework for proof search with set variable instantiation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:187-229 [Journal]
   
8. Didier Galmiche
   Connection methods in linear logic and proof nets construction. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:231-272 [Journal]
   
9. Gopalan Nadathur
   Correspondences between classical, intuitionistic and uniform provability. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:232, n:1-2, pp:273-298 [Journal]
   
10. Eike Ritter, David J. Pym, Lincoln A. Wallen
    On the intuitionistic force of classical search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:232, n:1-2, pp:299-333 [Journal]