Annals of Pure and Applied Logic 2000: Vol 104 Index

2 Pages·2000·0.25 MB·English

ANNALS OF
PURE AND
APPLIED LOGIC
Annals of Pure and Applied Logic 104 (2000) 343
www.elsevier.com/locate/apal
Author Index
Volume 104 (2000)
(The issue number is given in front of the page numbers.)
Arai, N.H., Relative efficiency of propositional proof systems:
resolution vs. cut-free LK 3— 16
Bellantoni, S.J., Niggl, K.-H. and Schwichtenberg, H., Higher
type recursion, ramification and polynomial time 17- 30
Burr, W., Functional interpretation of Aczel’s constructive
set theory 31- 73
de Nivelle, H., Deciding the E*-class by an a posteriori,
liftable order 219-232
Feferman, S. and Strahm, T., The unfolding of non-finitist
arithmetic 75- 96
Hendriks, L., Doing logic by computer: interpolation in
fragments of intuitionistic propositional logic 97-112
Hofmann, M., Safe recursion with higher types and
BCK-algebra 113-166
Mints, G., Reduction of finite and infinite derivations 167-188
Moerdijk, I. and Palmgren, E., Wellfounded trees in categories 189-218
Niggl, K.-H., see Bellantoni, S.J. 17- 30
Palmgren, E., see Moerdijk, I. 189-218
Pollett, C., Multifunction algebras and the provability of PH| 279-303
Schwichtenberg, H., see Bellantoni, S.J. 17- 30
Simpson, A.K., see van Oosten, J. 233-278
Strahm, T., see Feferman, S. 75- 96
Strahm, T., The non-recursive 4 operator, fixed point theories
with ordinals, and the bar rule 305-323
Trevisan, L., Interactive and probabilistic proof-checking 325-342
van Oosten, J. and Simpson, A.K., Axioms and counter(examples)
in synthetic domain theory 233-278
Elsevier Science B.V.