Journals in DBLP

Ann. Pure Appl. Logic
1995, volume: 75, number: 1-2

1. Sergei N. Artëmov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger, Albert Visser
   Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:1- [Journal]
   
2. Matthias Baaz, Richard Zach
   Generalizing Theorems in Real Closed Fields. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:3-23 [Journal]
   
3. Lev D. Beklemishev
   Iterated Local Reflection Versus Iterated Consistency. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:25-48 [Journal]
   
4. Alessandro Berarducci, Paola D'Aquino
   Delta₀-Complexity of the Relation y = \prod_{i <= n} F(i). [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:49-56 [Journal]
   
5. Wilfried Buchholz
   Proof-Theoretic Analysis of Termination Proofs. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:57-65 [Journal]
   
6. Samuel R. Buss
   Relating the Bounded Arithmetic and Polynomial Time Hierarchies. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:67-77 [Journal]
   
7. Fernando Ferreira
   What are the forall Sigma^b₁-Consequences of T¹₂ and T²₂? [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:79-88 [Journal]
   
8. Thomas Glaß
   Understanding Uniformity in Feferman's Explicit Mathematics. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:89-106 [Journal]
   
9. Max I. Kanovich
   Petri Nets, Horn Programs, Linear Logic and Vector Games. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:107-135 [Journal]
   
10. Alexey P. Kopylov
    On NP-Completeness in Linear Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:137-152 [Journal]
    
11. Karl-Heinz Niggl
    Towards the Computational Complexity of PR^omega-Terms. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:153-178 [Journal]
    
12. Mati Pentus
    Models for the Lambek Calculus. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:179-213 [Journal]