Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Catherine McCartin Parameterized counting problems. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:147-182 [Journal ] 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 ] 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 ]