Journals in DBLP

Theor. Comput. Sci.
2006, volume: 357, number: 1-3

1. Sergei N. Artëmov, Michael W. Mislove
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:1-3 [Journal]
   
2. Sergei N. Artëmov
   Justified common knowledge. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:4-22 [Journal]
   
3. Vladimir Brezhnev, Roman Kuznets
   Making knowledge explicit: How hard it is. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:23-34 [Journal]
   
4. Samuel R. Buss
   Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:35-52 [Journal]
   
5. Nachum Dershowitz, Claude Kirchner
   Abstract canonical presentations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:53-69 [Journal]
   
6. Martin Hyland, Gordon D. Plotkin, John Power
   Combining effects: Sum and tensor. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:70-99 [Journal]
   
7. Giorgi Japaridze
   From truth to computability I. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:100-135 [Journal]
   
8. Nikolai V. Krupski
   On the complexity of the reflected logic of proofs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:136-142 [Journal]
   
9. Vladimir Krupski
   Referential logic of proofs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:357, n:1-3, pp:143-166 [Journal]
   
10. Pavel Naumov
    Logic of subtyping. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:167-185 [Journal]
    
11. Mati Pentus
    Lambek calculus is NP-complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:186-201 [Journal]
    
12. Helmut Schwichtenberg
    An arithmetic for polynomial-time computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:202-214 [Journal]
    
13. Sergey Slavnov
    Geometrical semantics for linear logic (multiplicative fragment). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:215-229 [Journal]
    
14. Frédéric De Jaeger, Martín Hötzel Escardó, Gabriele Santini
    On the computational content of the Lawson topology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:230-240 [Journal]
    
15. Lisbeth Fajstrup, Martin Raußen, Eric Goubault
    Algebraic topology and concurrency. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:241-278 [Journal]