default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 37
Volume 37, Number 1, December 1997
- Karl-Heinz Niggl:
Non-definability of the Ackermann function with type 1 partial primitive recursion. 1-13 - Alasdair Urquhart:
The number of lines in Frege proofs with substitution. 15-19 - Wilfried Buchholz:
An intuitionistic fixed point theory. 21-27 - Marek Balcerzak
, Krzysztof Ciesielski, Tomasz Natkaniec:
Sierpinski-Zygmund functions that are Darboux, almost continuous, or have a perfect road. 29-35 - Kai Frederick Wehmeier:
Fragments of HAHA based on S1\Sigma_1-induction. 37-49 - Mitsuru Tada, Makoto Tatsuta:
The function ëa/mû\lfloor a/m\rfloor in sharply bounded arithmetic. 51-57 - Quintijn Puite, Harold Schellinx:
On the Jordan-Hölder decomposition of proof nets. 59-65
Volume 37, Number 2, March 1998
- Masahiro Hamano, Mitsuhiro Okada:
A direct independence proof of Buchholz's Hydra Game on finite labeled trees. 67-89 - Stefano Baratella, Carlo Toffalori:
The theory of [(Z)\vec]C(2)2{\vec Z}C(2)^2-lattices is decidable. 91-104 - Lars Kristiansen:
A jump operator on honest subrecursive degrees. 105-125 - Carlo Toffalori:
The decision problem for [(Z)\vec]C(p3){\vec Z}C(p^3)-lattices with pp prime. 127-142
Volume 37, Number 3, April 1998
- Thierry Coquand:
Two applications of Boolean models. 143-147 - Toshiyasu Arai:
Consistency proof via pointwise induction. 149-165 - Frank Wolter:
All finitely axiomatizable subframe logics containing the provability logic CSM 0_{0} are decidable. 167-182 - Jörg Brendle:
Mob families and mad families. 183-197 - Wolfgang Burr, Volker Hartung:
A characterization of the S1\Sigma_1-definable functions of KPw+ (uniform AC)KP\omega + (uniform\; AC). 199-214
Volume 37, Number 4, June 1998
- Enrique Casanovas:
A test for expandability. 221-234 - Jeremy Avigad:
An effective proof that open sets are Ramsey. 235-240 - Lorenz Halbeisen:
Symmetries between two Ramsey properties. 241-260 - Yoshihiro Abe:
Combinatorial characterization of P11\Pi^1_1-indescribability in PklP_{\kappa}\lambda. 261-272
Volume 37, Numbers 5-6, July 1998
- Gerhard Jäger, Wolfram Pohlers, Stanley S. Wainer:
Editorial Logic Colloquium '95, Haifa, Israel. 273 - Lev D. Beklemishev:
A proof-theoretic analysis of collection. 275-296 - Matthias Baaz, Richard Zach:
Note on generalizing theorems in algebraically closed fields. 297-307 - Gianluigi Bellin, Arnaud Fleury:
Planar and braided proof-nets for multiplicative linear logic with mix. 309-325 - Wil Dekkers, Martin W. Bunder, Henk Barendregt:
Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. 327-341 - Mariagnese Giusto, Alberto Marcone:
Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic. 343-362 - Ulrich Kohlenbach:
Elimination of Skolem functions for monotone formulas in analysis. 363-390 - Markus Marzetta, Thomas Strahm:
The m\mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. 391-413 - Grigori Mints:
Normal deduction in the intuitionistic linear logic. 415-425 - Andreas Weiermann:
Bounding derivation lengths with functions from the slow growing hierarchy. 427-441
Volume 37, Number 7, October 1998
- Karl-Heinz Niggl:
A restricted computation model on Scott domains and its partial primitive recursive functionals. 443-481 - Simon Thomas:
Groupwise density and the cofinality of the infinite symmetric group. 483-493 - Heike Mildenberger, Otmar Spinas:
Meeting infinitely many cells of a partition once. 495-503
Volume 37, Number 8, November 1998
- Benedikt Löwe:
Uniform unfolding and analytic measurability. 505-520 - Marcus Schaefer:
A guided tour of minimal indices and shortest descriptions. 521-548
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-10-22 02:15 CEST 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:
