The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Rodney G. Downey, Robert Goldblatt
    Foreword. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:1-0 [Journal]
  2. Eric Allender, Harry Buhrman, Michal Koucký
    What can be efficiently reduced to the Kolmogorov-random strings? [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:2-19 [Journal]
  3. Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn
    On partial randomness. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:20-30 [Journal]
  4. Chi Tat Chong, Angsheng Li, Yue Yang
    The existence of high nonbounding degrees in the difference hierarchy. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:31-51 [Journal]
  5. Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller
    On self-embeddings of computable linear orderings. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:52-76 [Journal]
  6. Robert Goldblatt
    Final coalgebras and the Hennessy-Milner property. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:77-93 [Journal]
  7. Ian M. Hodkinson
    Complexity of monodic guarded fragments over linear and real time. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:94-125 [Journal]
  8. Orna Kupferman, Shmuel Safra, Moshe Y. Vardi
    Relating word and tree automata. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:126-146 [Journal]
  9. Catherine McCartin
    Parameterized counting problems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:147-182 [Journal]
  10. Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
    Kolmogorov-Loveland randomness and stochasticity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:183-210 [Journal]
  11. Guohua Wu
    1-Generic splittings of computably enumerable degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:211-219 [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