Journals in DBLP

Ann. Pure Appl. Logic
2006, volume: 142, number: 1-3

1. Georg Moser
   Ackermann's substitution method (remixed). [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:1-18 [Journal]
   
2. Krzysztof Krupinski
   Profinite structures interpretable in fields. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:19-54 [Journal]
   
3. James Cummings, Matthew Foreman, Menachem Magidor
   Canonical structure in the universe of set theory: part two. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:55-75 [Journal]
   
4. Greg Piper
   Square and non-reflection in the context of P_{k lambda}. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:76-97 [Journal]
   
5. David Asperó
   Coding by club-sequences. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:98-114 [Journal]
   
6. Ziv Shami
   On analyzability in the forking topology for simple theories. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:115-124 [Journal]
   
7. Makoto Kanazawa
   Computing interpolants in implicational logics. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:125-201 [Journal]
   
8. Ottavio M. D'Antona, Vincenzo Marra
   Computing coproducts of finitely presented Gödel algebras. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:202-211 [Journal]
   
9. Jean-Marc Andreoli, Roberto Maieli, Paul Ruet
   Non-commutative proof construction: A constraint-based approach. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:212-244 [Journal]
   
10. David Gabelaia, Agi Kurucz, Frank Wolter, Michael Zakharyaschev
    Non-primitive recursive decidability of products of modal logics with expanding domains. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:245-268 [Journal]
    
11. Matthias Baaz, Rosalie Iemhoff
    The Skolemization of existential quantifiers in intuitionistic logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:269-295 [Journal]
    
12. Elisabeth Bouscaren, Ehud Hrushovski
    Classifiable theories without finitary invariants. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:296-320 [Journal]
    
13. Achim Blumensath
    A model-theoretic characterisation of clique width. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:321-350 [Journal]
    
14. Abderezak Ould Houcine
    Satisfaction of existential theories in finitely presented groups and some embedding theorems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:351-365 [Journal]
    
15. Emil Jerábek
    Frege systems for extensible modal logics. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:366-379 [Journal]
    
16. Sakaé Fuchino, Noam Greenberg, Saharon Shelah
    Models of real-valued measurability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:380-397 [Journal]
    
17. Tetsuya Ishiu
    The saturation of club guessing ideals. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:398-424 [Journal]
    
18. Pandelis Dodos
    Codings of separable compact subsets of the first Baire class. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:425-441 [Journal]