nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A general storage theorem for integers in call-by-name λ-calculus
|
Krivine, Jean-Louis |
|
1994 |
129 |
1 |
p. 79-94 16 p. |
artikel |
2 |
A tableau-like proof procedure for normal modal logics
|
Ognjanović, Zoran |
|
1994 |
129 |
1 |
p. 167-186 20 p. |
artikel |
3 |
Correctness of fixpoint transformations
|
Wei, Jiawang |
|
1994 |
129 |
1 |
p. 123-142 20 p. |
artikel |
4 |
Depth of proofs, depth of cut-formulas and complexity of cut formulas
|
Zhang, Wenhui |
|
1994 |
129 |
1 |
p. 193-206 14 p. |
artikel |
5 |
Editorial board
|
|
|
1994 |
129 |
1 |
p. ii-iv nvt p. |
artikel |
6 |
F-semantics for type assignment systems
|
Yokouchi, Hirofumi |
|
1994 |
129 |
1 |
p. 39-77 39 p. |
artikel |
7 |
On the mutual-exclusion problem — a quest for minimal solutions
|
Abraham, Uri |
|
1994 |
129 |
1 |
p. 1-38 38 p. |
artikel |
8 |
Regular relations and bicartesian squares
|
Banach, R. |
|
1994 |
129 |
1 |
p. 187-192 6 p. |
artikel |
9 |
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
|
Chen, Cheng-Chia |
|
1994 |
129 |
1 |
p. 95-121 27 p. |
artikel |
10 |
The role of standardising apart in logic programming
|
Shepherdson, J.C. |
|
1994 |
129 |
1 |
p. 143-166 24 p. |
artikel |