Journals in DBLP

Ann. Pure Appl. Logic
2001, volume: 113, number: 1-3

1. Yuri Matiyasevich
   Preface. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:1-0 [Journal]
   
2. Matthias Baaz, Petr Hájek, Franco Montagna, Helmut Veith
   Complexity of t-tautologies. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:3-11 [Journal]
   
3. Danièle Beauquier, Anatol Slissenko
   A first order logic for specification of timed algorithms: basic properties and a decidable class. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:13-52 [Journal]
   
4. Anatoly Petrovich Beltiukov
   The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:53-58 [Journal]
   
5. Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich
   Window-accumulated subsequence matching problem is linear. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:59-80 [Journal]
   
6. Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev
   MAX SAT approximation beyond the limits of polynomial-time approximation. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:81-94 [Journal]
   
7. Gennady Davydov, Inna Davydova
   Towards logical operations research - propositional case. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:95-119 [Journal]
   
8. Lew Gordeev
   Finite methods in 1-order formalisms. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:121-151 [Journal]
   
9. Dima Grigoriev, Nicolai Vorobjov
   Complexity of Null-and Positivstellensatz proofs. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:153-160 [Journal]
   
10. Rosalie Iemhoff
    A (nother) characterization of intuitionistic propositional logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:161-173 [Journal]
    
11. Nikolai Kossovski
    Computational complexity of quantifier-free negationless theory of field of rational numbers. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:175-180 [Journal]
    
12. Vladimir Krupski
    The single-conclusion proof logic and inference rules specification. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:181-206 [Journal]
    
13. Vladimir Lifschitz
    On calculational proofs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:207-224 [Journal]
    
14. Grigori Mints
    Interpolation theorems for intuitionistic predicate logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:225-242 [Journal]
    
15. Valery Plisko
    Arithmetic complexity of the predicate logics of certain complete arithmetic theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:243-259 [Journal]
    
16. N. A. Shanin
    On a finitary version of mathematical analysis. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:261-295 [Journal]
    
17. Zhaohui Luo
    Coercion completion and conservativity in coercive subtyping. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:297-322 [Journal]
    
18. Michael A. Taitslin
    A general condition for collapse results. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:323-330 [Journal]
    
19. Maxim Vsemirnov
    The Woods-Erdös conjecture for polynomial rings. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:331-344 [Journal]
    
20. Tatiana Yavorskaya
    Logic of proofs and provability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:345-372 [Journal]
    
21. Rostislav E. Yavorsky
    Provability logics with quantifiers on proofs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:373-387 [Journal]
    
22. I. D. Zaslavsky
    Dual realizability in symmetric logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:389-397 [Journal]