Volume 322; Issue 1

Theoretical Computer Science

Volume 322; Issue 1
1

Foreword

Year:
2004
Language:
english
File:
PDF, 152 KB
english, 2004
2

Well-behaved principles alternative to bounded induction

Year:
2004
Language:
english
File:
PDF, 248 KB
english, 2004
3

On the complexity of decision using destinies in H-bounded structures

Year:
2004
Language:
english
File:
PDF, 391 KB
english, 2004
4

Recursion and topology on 2⩽ω for possibly infinite computations

Year:
2004
Language:
english
File:
PDF, 542 KB
english, 2004
5

Arithmetical definability and computational complexity

Year:
2004
Language:
english
File:
PDF, 223 KB
english, 2004
7

EMSO-logic and automata related to homogeneous flow event structures

Year:
2004
Language:
english
File:
PDF, 359 KB
english, 2004
8

On some generalizations of the primitive recursive arithmetic

Year:
2004
Language:
english
File:
PDF, 212 KB
english, 2004
9

Editorial board v-ix

Year:
2004
Language:
english
File:
PDF, 107 KB
english, 2004
10

A strong induction scheme that leads to polynomially computable realizations

Year:
2004
Language:
english
File:
PDF, 250 KB
english, 2004
11

Closure properties of locally finite ω-languages

Year:
2004
Language:
english
File:
PDF, 270 KB
english, 2004
12

Three-variable statements of set-pairing

Year:
2004
Language:
english
File:
PDF, 402 KB
english, 2004
13

Subset sum “cubes” and the complexity of primality testing

Year:
2004
Language:
english
File:
PDF, 268 KB
english, 2004