nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
About cut elimination for logics of common knowledge
|
Alberucci, Luca |
|
2005 |
133 |
1-3 |
p. 73-99 27 p. |
artikel |
2 |
Abstract State Machines: a unifying view of models of computation and of system design frameworks
|
Börger, Egon |
|
2005 |
133 |
1-3 |
p. 149-171 23 p. |
artikel |
3 |
A game semantics for generic polymorphism
|
Abramsky, Samson |
|
2005 |
133 |
1-3 |
p. 3-37 35 p. |
artikel |
4 |
Algebraically complete semirings and Greibach normal form
|
Ésik, Zoltán |
|
2005 |
133 |
1-3 |
p. 173-203 31 p. |
artikel |
5 |
A proof of topological completeness for S4 in (0, 1)
|
Mints, Grigori |
|
2005 |
133 |
1-3 |
p. 231-245 15 p. |
artikel |
6 |
Author Index
|
|
|
2005 |
133 |
1-3 |
p. 339-340 2 p. |
artikel |
7 |
Automated search for Gödel’s proofs
|
Sieg, Wilfried |
|
2005 |
133 |
1-3 |
p. 319-338 20 p. |
artikel |
8 |
Axioms for strict and lazy functional programs
|
Stärk, Robert F. |
|
2005 |
133 |
1-3 |
p. 293-318 26 p. |
artikel |
9 |
Contents
|
|
|
2005 |
133 |
1-3 |
p. vii-viii nvt p. |
artikel |
10 |
Continuous normalization for the lambda-calculus and Gödel’s T
|
Aehlig, Klaus |
|
2005 |
133 |
1-3 |
p. 39-71 33 p. |
artikel |
11 |
Control structures in programs and computational complexity
|
Niggl, Karl-Heinz |
|
2005 |
133 |
1-3 |
p. 247-273 27 p. |
artikel |
12 |
Editorial Board
|
|
|
2005 |
133 |
1-3 |
p. ii- 1 p. |
artikel |
13 |
Elementary arithmetic
|
Ostrin, G.E. |
|
2005 |
133 |
1-3 |
p. 275-292 18 p. |
artikel |
14 |
Non-strictly positive fixed points for classical natural deduction
|
Matthes, Ralph |
|
2005 |
133 |
1-3 |
p. 205-230 26 p. |
artikel |
15 |
Preface
|
Buchholz, Wilfried |
|
2005 |
133 |
1-3 |
p. 1- 1 p. |
artikel |
16 |
Uniform Heyting arithmetic
|
Berger, Ulrich |
|
2005 |
133 |
1-3 |
p. 125-148 24 p. |
artikel |
17 |
Zero, successor and equality in BDDs
|
Badban, Bahareh |
|
2005 |
133 |
1-3 |
p. 101-123 23 p. |
artikel |