default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 104
Volume 104, Number 1-3, 15 May 2000
- Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel:
Preface. 1-2 - Noriko H. Arai
:
Relative efficency of propositional proof systems: resolution vs. cut-free LK. 3-16 - Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg:
Higher type recursion, ramification and polynomial time. 17-30 - Wolfgang Burr:
Functional interpretation of Aczel's constructive set theory. 31-73 - Solomon Feferman, Thomas Strahm:
The unfolding of non-finitist arithmetic. 75-96 - Lex Hendriks:
Doing logic b computer: interpolation in fragments ofinstuitionistic propositional logic. 97-112 - Martin Hofmann:
Safe recursion with higher types and BCK-algebra. 113-166 - Grigori Mints:
Reduction of finite and infinite derivations. 167-188 - Ieke Moerdijk, Erik Palmgren:
Wellfounded trees in categories. 189-218 - Hans de Nivelle:
Deciding the E+ - class by an a posteriori, liftable order. 219-232 - Jaap van Oosten, Alex K. Simpson:
Axioms and (counter) examples in synthetic domain theory. 233-278 - Chris Pollett:
Multifunction algebras and the provability of PH. 279-302 - Thomas Strahm:
The non-constructive mu operator, fixed point theories with ordinals, and the bar rule. 305-324 - Luca Trevisan:
Interactive and probabilistic proof-checking. 325-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
