Annals of Pure and Applied Logic 2000: Vol 104 Table of Contents

7 Pages·2000·1.4 MB·English

ANNALS OF
PURE AND
APPLIED LOGIC
Volume 104 - 2000
Chief Guest Editor
C. Butz
Department of Mathematics and Statistics,
Burnside Hall, McGill University,
805 Sherbrooke Street West, Montreal, Que.,
Canada H3A 2K6
E-mail address: [email protected]
Guest-editors
Ulrich Kohlenbach
S¢gren Riis
Glynn Winskel
Managing Editors
|. Moerdijk (Co-ordinating Editor) (Categorical logic, Constructive/intuition-
istic logic), Rijksuniversiteit Utrecht, Mathematisch Instituut,
Postbus 80.010, 3508 TA Utrecht, The Netherlands
S.N. Artemov Steklov Mathematical Institute, Vavilova 42, 117966 Moscow
GSP-1, Russia (Proof Theory, Logic and Computer Science)
J.-Y. Girard CNRS, Institut de Mathematiques de Luminy, UPR 9016, 163
Avenue de Luminy, Case 930, 13288 Marseille Cedex 9, France
T. Jech Mathematics Department, The Pennsylvania State University,
University Park, PA 16802, USA (Set Theory)
P.G. Kolaitis Computer Science Department, University of California, Santa
Cruz, CA 95064, USA (Logic and Computer Science)
A. Scedrov Department of Mathematics, University of Pennsylvania, 209
South 33rd Street, Philadelphia, PA 19104-6395, USA
R.|. Soare Department of Mathematics, University of Chicago, 5734
University Avenue, Chicago, IL 60637-1546, USA (Computability
Theory, Recursion in Logic) (E-mail submissions in LaTeX greatly
preferred, [email protected])
A.J. Wilkie Mathematical Institute, University of Oxford, 24-29 St. Giles,
Oxford, OX1 3LB, UK (Model Theory)
Advisory Editors
J.A. Bergstra FWI Vakgroep Programmatuur, Universiteit van Amsterdam,
Kruislaan 403, 1098 SJ Amsterdam, The Netherlands
W. Buchholz Mathematisches Institut der Ludwig-Maximilians-Universitat,
TheresienstraRe 39, D-80333 Miinchen, Germany
S.R. Buss University of California, Departments of Mathematics & Com-
puter Science, San Diego, La Jolla, CA 92093-0112, USA
G. Huet INRIA, Domaine de Voluceau, B.P. 105, 78153 Le Chesnay Cedex,
France
J. Krajicek Mathematical Institute, Academy of Sciences, Zitna 25, Prague
115 67, Czech Republic
J.A. Makowsky Faculty of Computer Science, Technion - Israel Institute of Tech-
nology, Technion City, Haifa 32000, Israel
D. Marker Department of Mathematics, University of Illinois at Chicago,
851 S. Morgan Street, Chicago, IL 60607, USA
D. Normann Institute of Mathematics, P.O. Box 1053, Blindern, 0316 Oslo,
Norway
H. Ono School of Information Science, Japan Advanced Institute of
Science and Technology, Tatsunokuchi, Ishikawa 923-12, Japan
Editors Emeriti
C.C. Chang, D. van Dalen, J.E. Fenstad, Y. Gurevich, J. Hartmanis, K. Kunen, A.
Mostowski, A. Nerode, A. Prestel, M.O. Rabin, H. Roger Jr.
ANNALS OF
PURE AND
APPLIED LOGIC
Volume 104 - 2000
Chief Guest Editor
C. Butz
Department of Mathematics and Statistics,
Burnside Hall, McGill University,
805 Sherbrooke Street West, Montreal, Que.,
Canada H3A 2K6
E-mail address: [email protected]
Guest-editors
Ulrich Kohlenbach
S¢gren Riis
Glynn Winskel
NORTH-HOLLAND - Amsterdam - Lausanne - New York - Oxford - Shannon - Tokyo
© 2000 Elsevier Science B.V. All rights reserved.
This journal and the individual contributions contained in it are protected under copyright by
Elsevier Science B.V. and the following terms and conditions apply to their use:
Photocopying
Single photocopies of single articles may be made for personal use as allowed by national copyright
laws. Permission of the publisher and payment of a fee is required for all other photocopying,
including multiple or systematic copying, copying for advertising or promotional purposes, resale,
and all forms of document delivery. Special rates are available for educational institutions that wish
to make photocopies for non-profit educational classroom use.
Permissions may be sought directly from Elsevier Science Global Rights Department, PO Box 800,
Oxford OX5 1DX, UK; phone: (+ 44) 1865 843830, fax: [phone], e-mail: permissions@else-
vier.co.uk. You may also contact Global Rights directly through Elsevier’s homepage
(http://www.elsevier.nl), by selecting ‘Obtaining Permissions’.
In the USA, users may clear permissions and make payments through the Copyright Clearance
(978) 7504744, and in the UK through the Copyright Licensing Agency Rapid Clearance Service
(CLARCS), 90 Tottenham Court Road, London W1POLP, UK; phone: (+44) 207631 5555;
fax: [phone]. Other countries may have a local reprographic rights agency for payments.
Derivative Works
Subscribers may reproduce tables of contents or prepare lists of articles including abstracts for
internal circulation within their institutions. Permission of the publisher is required for resale or
distribution outside the institution.
Permission of the publisher is required for all other derivative works, including compilations and
translations.
Electronic Storage or Usage
Permission of the publisher is required to store or use electronically any material contained in this
journal, including any article or part of an article.
Except as outlined above, no part of this publication may be reproduced, stored in a retrieval system
or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or
otherwise, without prior written permission of the publisher.
Address permissions requests to: Elsevier Science Global Rights Department, at the mail, fax and
e-mail addresses noted above.
Notice
No responsibility is assumed by the Publisher for any injury and/or damage to persons or property as
a matter of products liability, negligence or otherwise, or from any use or operation of any methods,
products, instructions or ideas contained in the material herein. Because of rapid advances in the
medical sciences, in particular, independent verification of diagnoses and drug dosages should be
made.
Although all advertising material is expected to conform to ethical (medical) standards, inclusion in
this publication does not constitute a guarantee or endorsement of the quality or value of such
product or of the claims made of it by its manufacturer.
ANNALS OF PURE AND APPLIED LOGIC
Volume 104, Numbers 1-3, 15 July 2000
SPECIAL ISSUE
Proceedings of the
Workshop on Proof Theory
and Complexity PTAC’98
University of Aarhus,
Denmark, August 3-7, 1998
Guest-editors
Carsten Butz
Ulrich Kohlenbach
S¢gren Riis
Glynn Winskel
Contents
Preface
N.H. Arai
Relative efficiency of propositional proof systems: resolution vs. cut-free LK
S.J. Bellantoni, K.-H. Niggl and H. Schwichtenberg
Higher type recursion, ramification and polynomial time
W. Burr
Functional interpretation of Aczel’s constructive set theory
S. Feferman and T. Strahm
The unfolding of non-finitist arithmetic
L. Hendriks
Doing logic by computer: interpolation in fragments of intuitionistic
propositional logic
M. Hofmann
Safe recursion with higher types and BCK-algebra
G. Mints
Reduction of finite and infinite derivations
I. Moerdijk and E. Palmgren
Wellfounded trees in categories
H. de Nivelle
Deciding the E*-class by an a posteriori, liftable order
J. van Oosten and A.K. Simpson
Axioms and (counter)examples in synthetic domain theory
C. Pollett
Multifunction algebras and the provability of PH|
Contents
T Strahm
The non-recursive yp operator, fixed point theories with ordinals, and the
bar rule
L. Trevisan
Interactive and probabilistic proof-checking
Author Index