nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Axioms and (counter)examples in synthetic domain theory
|
van Oosten, Jaap |
|
2000 |
104 |
1-3 |
p. 233-278 46 p. |
artikel |
2 |
Deciding the E+ -class by an a posteriori, liftable order
|
de Nivelle, Hans |
|
2000 |
104 |
1-3 |
p. 219-232 14 p. |
artikel |
3 |
Doing logic by computer: interpolation in fragments of intuitionistic propositional logic
|
Hendriks, Lex |
|
2000 |
104 |
1-3 |
p. 97-112 16 p. |
artikel |
4 |
Functional interpretation of Aczel's constructive set theory
|
Burr, Wolfgang |
|
2000 |
104 |
1-3 |
p. 31-73 43 p. |
artikel |
5 |
Higher type recursion, ramification and polynomial time
|
Bellantoni, Stephen J. |
|
2000 |
104 |
1-3 |
p. 17-30 14 p. |
artikel |
6 |
Index
|
|
|
2000 |
104 |
1-3 |
p. v-vi nvt p. |
artikel |
7 |
Index
|
|
|
2000 |
104 |
1-3 |
p. 343- 1 p. |
artikel |
8 |
Interactive and probabilistic proof-checking
|
Trevisan, Luca |
|
2000 |
104 |
1-3 |
p. 325-342 18 p. |
artikel |
9 |
Multifunction algebras and the provability of PH↓
|
Pollett, Chris |
|
2000 |
104 |
1-3 |
p. 279-303 25 p. |
artikel |
10 |
Preface
|
Butz, C. |
|
2000 |
104 |
1-3 |
p. 1-2 2 p. |
artikel |
11 |
Reduction of finite and infinite derivations
|
Mints, G. |
|
2000 |
104 |
1-3 |
p. 167-188 22 p. |
artikel |
12 |
Relative efficiency of propositional proof systems: resolution vs. cut-free LK
|
Arai, Noriko H. |
|
2000 |
104 |
1-3 |
p. 3-16 14 p. |
artikel |
13 |
Safe recursion with higher types and BCK-algebra
|
Hofmann, Martin |
|
2000 |
104 |
1-3 |
p. 113-166 54 p. |
artikel |
14 |
The non-constructive μ operator, fixed point theories with ordinals, and the bar rule
|
Strahm, Thomas |
|
2000 |
104 |
1-3 |
p. 305-324 20 p. |
artikel |
15 |
The unfolding of non-finitist arithmetic
|
Feferman, Solomon |
|
2000 |
104 |
1-3 |
p. 75-96 22 p. |
artikel |
16 |
Wellfounded trees in categories
|
Moerdijk, Ieke |
|
2000 |
104 |
1-3 |
p. 189-218 30 p. |
artikel |