Journals in DBLP

J. Symb. Log.
1968, volume: 33, number: 3

1. G. Kreisel
   A Survey of Proof Theory. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:321-388 [Journal]
   
2. Graham C. Driscoll Jr.
   Metarecursively Enumerable Sets and Their Metadegrees. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:389-411 [Journal]
   
3. Dirk van Dalen
   Reducibilities in Intuitionistic Topology. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:412-417 [Journal]
   
4. Dennis F. Cudia, Wilson E. Singletary
   The Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:418-430 [Journal]
   
5. Alistair H. Lachlan
   Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:431-443 [Journal]
   
6. M. K. Rennie
   S3(S) = S3.5. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:444-445 [Journal]
   
7. Kenneth Kunen
   Implicit Definability and Infinitary Languages. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:446-451 [Journal]
   
8. Dag Prawitz
   Hauptsatz for Higher Order Logic. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:452-457 [Journal]
   
9. J. Jay Zeman
   Lemmon-Style Bases for the Systems S1 ^ring- S4^ring . [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1968, v:33, n:3, pp:458-461 [Journal]
   
10. J. Jay Zeman
    The Semisubstitutivity of Strict Implication. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1968, v:33, n:3, pp:462-464 [Journal]
    
11. M. H. Lob, F. R. Drake, John Derrick
    Meeting of the Association for Symbolic Logic Leeds 1967. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1968, v:33, n:3, pp:490- [Journal]