Journals in DBLP

Ann. Pure Appl. Logic
1998, volume: 94, number: 1-3

1. Arnold Beckmann, Wolfram Pohlers
   Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:7-19 [Journal]
   
2. Douglas A. Cenzer, Jeffrey B. Remmel
   Feasible Graphs with Standard Universe. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:21-35 [Journal]
   
3. Peter Cholak
   The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:37-44 [Journal]
   
4. Rodney G. Downey, Richard A. Shore
   Splitting Theorems and the Jump Operator. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:45-52 [Journal]
   
5. Peter A. Fejer
   Lattice Representations for Computability Theory. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:53-74 [Journal]
   
6. Sergei S. Goncharov
   Decidable Boolean Algebras of Low Level. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:75-95 [Journal]
   
7. Leo Harrington, Robert I. Soare
   Definable Properties of the Computably Enumerable Sets. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:97-125 [Journal]
   
8. Julia F. Knight
   Coding a Family of Sets. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:127-142 [Journal]
   
9. Manuel Lerman
   A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:143-180 [Journal]
   
10. Michael Rathjen, Edward R. Griffor, Erik Palmgren
    Inaccessibility in Constructive Set Theory and Type Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:181-200 [Journal]
    
11. Helmut Schwichtenberg
    Finite Notations for Infinite Terms. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:201-222 [Journal]
    
12. Alexandra Shlapentokh
    Weak Presentations of Non-Finitely Generated Fields. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:223-252 [Journal]
    
13. Theodore A. Slaman, W. Hugh Woodin
    Extending Partial Orders to Dense Linear Orders. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:253-261 [Journal]
    
14. Andrea Sorbi
    Sets of Generators and Automorphism Bases for the Enumeration Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:263-272 [Journal]
    
15. Frank Stephan
    Learning via Queries and Oracles. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:273-296 [Journal]