Journals in DBLP

Ann. Pure Appl. Logic
2007, volume: 145, number: 3

1. Robert Saxon Milnikel
   Derivability in certain subsystems of the Logic of Proofs is Pi₂^p-complete. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:223-239 [Journal]
   
2. Milos S. Kurilic
   Splitting families and forcing. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:240-251 [Journal]
   
3. Andrew E. M. Lewis, George Barmpalias
   Randomness and the linear degrees of computability. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:252-257 [Journal]
   
4. Gennadi Puninski, Vera Puninskaya, Carlo Toffalori
   Decidability of the theory of modules over commutative valuation domains. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:258-275 [Journal]
   
5. Masahiro Hamano, Philip J. Scott
   A categorical semantics for polarized MALL. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:276-313 [Journal]
   
6. Erik Palmgren, Steven J. Vickers
   Partial Horn logic and cartesian categories. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:314-353 [Journal]
   
7. Beibut Sh. Kulpeshov
   Criterion for binarity of N₀-categorical weakly o-minimal theories. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:354-367 [Journal]
   
8. Silvio Valentini
   Constructive characterizations of bar subsets. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2007, v:145, n:3, pp:368-378 [Journal]