Journals in DBLP

J. Symb. Log.
1967, volume: 32, number: 2

1. Mariko Yasugi
   Interpretations of Set Theory and Ordinal Number Theory. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:145-161 [Journal]
   
2. Robert W. Robinson
   Simplicity of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:162-172 [Journal]
   
3. James C. Owings Jr.
   Recursion, Metarecursion, and Inclusion. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:173-179 [Journal]
   
4. Robert A. Di Paola
   Some Theorems on Extensions of Arithmetic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:180-189 [Journal]
   
5. R. L. Graham
   On n-Valued Functionally Complete Truth Functions. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:190-195 [Journal]
   
6. James Thomson
   Proof of the Law of Infinite Conjunction using the Perfect Disjunctive Normal Form. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:196-197 [Journal]
   
7. William Tait
   Intensional Interpretations of Functionals of Finite Type I. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:198-212 [Journal]
   
8. Bruce Lercher
   Strong Reduction and Normal Form in Combinatory Logic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:213-223 [Journal]
   
9. J. Roger Hindley
   Axioms for Strong Reduction in Combinatory Logic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1967, v:32, n:2, pp:224-236 [Journal]
   
10. Bruce Lercher
    The Decidability of Hindley's Axioms for Strong Reduction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1967, v:32, n:2, pp:237-239 [Journal]