|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
13 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | Arithmetical definability and computational complexity |
Hachaı̈chi, Yassine |
2004 |
322 | 1 |
p. 137-146 10 p. |
artikel |
|
| 2 | A strong induction scheme that leads to polynomially computable realizations |
Beltiukov, Anatoly Petrivich |
2004 |
322 | 1 |
p. 17-39 23 p. |
artikel |
|
| 3 | Closure properties of locally finite ω-languages |
Finkel, Olivier |
2004 |
322 | 1 |
p. 69-84 16 p. |
artikel |
|
| 4 | Editorial board v-ix |
2004 |
322 | 1 |
p. v-ix nvt p. |
artikel |
||
| 5 | EMSO-logic and automata related to homogeneous flow event structures |
Shahbazyan, K |
2004 |
322 | 1 |
p. 181-201 21 p. |
artikel |
|
| 6 | Foreword |
Cégielski, Patrick |
2004 |
322 | 1 |
p. 1-3 3 p. |
artikel |
|
| 7 | On some generalizations of the primitive recursive arithmetic |
Zaslavsky, I.D |
2004 |
322 | 1 |
p. 221-230 10 p. |
artikel |
|
| 8 | On the complexity of decision using destinies in H-bounded structures |
Chateau, A |
2004 |
322 | 1 |
p. 41-67 27 p. |
artikel |
|
| 9 | Recursion and topology on 2⩽ω for possibly infinite computations |
Becher, Verónica |
2004 |
322 | 1 |
p. 85-136 52 p. |
artikel |
|
| 10 | Subset sum “cubes” and the complexity of primality testing |
R. Woods, Alan |
2004 |
322 | 1 |
p. 203-219 17 p. |
artikel |
|
| 11 | Three-variable statements of set-pairing |
Formisano, Andrea |
2004 |
322 | 1 |
p. 147-173 27 p. |
artikel |
|
| 12 | Well-behaved principles alternative to bounded induction |
Adamowicz, Zofia |
2004 |
322 | 1 |
p. 5-16 12 p. |
artikel |
|
| 13 | Winning strategies for infinite games: from large cardinals to computer science extended abstract |
Ressayre, Jean-Pierre |
2004 |
322 | 1 |
p. 175-179 5 p. |
artikel |
13 gevonden resultaten