Annals of Pure and Applied Logic, Volume 138

Volume 138, Numbers 1-3, March 2006

• Rodney G. Downey, Robert Goldblatt:
  Foreword. 1-
  
• Eric Allender, Harry Buhrman, Michal Koucký:
  What can be efficiently reduced to the Kolmogorov-random strings? 2-19
  
• Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn:
  On partial randomness. 20-30
  
• Chi Tat Chong, Angsheng Li, Yue Yang:
  The existence of high nonbounding degrees in the difference hierarchy. 31-51
  
• Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller:
  On self-embeddings of computable linear orderings. 52-76
  
• Robert Goldblatt:
  Final coalgebras and the Hennessy-Milner property. 77-93
  
• Ian M. Hodkinson:
  Complexity of monodic guarded fragments over linear and real time. 94-125
  
• Orna Kupferman, Shmuel Safra, Moshe Y. Vardi:
  Relating word and tree automata. 126-146
  
• Catherine McCartin:
  Parameterized counting problems. 147-182
  
• Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan:
  Kolmogorov-Loveland randomness and stochasticity. 183-210
  
• Guohua Wu:
  1-Generic splittings of computably enumerable degrees. 211-219