Annals of Pure and Applied Logic

1

Foreword

Rod Downey, Rob Goldblatt

Journal:

Year:

2006

Language:

english

File:

PDF, 80 KB

english, 2006

2

What can be efficiently reduced to the Kolmogorov-random strings?

Eric Allender, Harry Buhrman, Michal Koucký

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 268 KB

english, 2006

3

On partial randomness

Cristian S. Calude, Ludwig Staiger, Sebastiaan A. Terwijn

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 199 KB

english, 2006

4

Complexity of monodic guarded fragments over linear and real time

Ian Hodkinson

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 442 KB

english, 2006

5

Kolmogorov–Loveland randomness and stochasticity

Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 381 KB

english, 2006

6

1-Generic splittings of computably enumerable degrees

Guohua Wu

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 174 KB

english, 2006

7

Final coalgebras and the Hennessy–Milner property

Robert Goldblatt

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 261 KB

english, 2006

8

On self-embeddings of computable linear orderings

Rodney G. Downey, Carl Jockusch, Joseph S. Miller

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 340 KB

english, 2006

9

Parameterized counting problems

Catherine McCartin

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 379 KB

english, 2006

10

Editorial Board

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 21 KB

english, 2006

11

Author Index

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 78 KB

english, 2006

13

The existence of high nonbounding degrees in the difference hierarchy

C.T. Chong, A. Li, Y. Yang

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 277 KB

english, 2006

14

Relating word and tree automata

Orna Kupferman, Shmuel Safra, Moshe Y. Vardi

Journal:

Annals of Pure and Applied Logic

Year:

2006

Language:

english

File:

PDF, 301 KB

english, 2006

Volume 138; Issue 1-3

Foreword

What can be efficiently reduced to the Kolmogorov-random strings?

On partial randomness

Complexity of monodic guarded fragments over linear and real time

Kolmogorov–Loveland randomness and stochasticity

1-Generic splittings of computably enumerable degrees

Final coalgebras and the Hennessy–Milner property

On self-embeddings of computable linear orderings

Parameterized counting problems

Editorial Board

Contents

Author Index

The existence of high nonbounding degrees in the difference hierarchy

Relating word and tree automata