The SCEAS System
Navigation Menu

Journals in DBLP

Ann. Pure Appl. Logic
2006, volume: 141, number: 3

  1. Yuri Matiyasevich, Sergei N. Artëmov
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:307- [Journal]
  2. Danièle Beauquier
    Decidable properties for monadic abstract state machines. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:308-319 [Journal]
  3. Anatoly Petrovich Beltiukov
    A nonasymptotic lower time bound for a strictly bounded second-order arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:320-324 [Journal]
  4. A. V. Chernavsky, V. P. Leksine
    Unrecognizability of manifolds. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:325-335 [Journal]
  5. Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev
    On complexity of verification of interacting agents' behavior. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:336-362 [Journal]
  6. S. Fratani, Géraud Sénizergues
    Iterated pushdown automata and sequences of rational numbers. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:363-411 [Journal]
  7. Dima Grigoriev, S. Vakulenko
    Algorithms and complexity in biological pattern formation problems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:412-428 [Journal]
  8. Edward A. Hirsch, Arist Kojevnikov
    Several notes on the power of Gomory-Chvátal cuts. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:429-436 [Journal]
  9. Andrej Muchnik, Alexei L. Semenov
    Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:437-441 [Journal]
  10. Michael Rathjen, Sergei Tupailo
    Characterizing the interpretation of set theory in Martin-Löf typetheory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:442-471 [Journal]
  11. Dan E. Willard
    A generalization of the Second Incompleteness Theorem and some exceptions to it. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:472-496 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002