Archive 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
  Electronic Edition (link) BibTeX
• Alasdair Urquhart:
  The number of lines in Frege proofs with substitution. 15-19
  Electronic Edition (link) BibTeX
• Wilfried Buchholz:
  An intuitionistic fixed point theory. 21-27
  Electronic Edition (link) BibTeX
• Marek Balcerzak, Krzysztof Ciesielski, Tomasz Natkaniec:
  Sierpinski-Zygmund functions that are Darboux, almost continuous, or have a perfect road. 29-35
  Electronic Edition (link) BibTeX
• Kai F. Wehmeier:
  Fragments of HAHA based on S₁\Sigma_1-induction. 37-49
  Electronic Edition (link) BibTeX
• Mitsuru Tada, Makoto Tatsuta:
  The function ëa/mû\lfloor a/m\rfloor in sharply bounded arithmetic. 51-57
  Electronic Edition (link) BibTeX
• Quintijn Puite, Harold Schellinx:
  On the Jordan-Hölder decomposition of proof nets. 59-65
  Electronic Edition (link) BibTeX

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
  Electronic Edition (link) BibTeX
• Stefano Baratella, Carlo Toffalori:
  The theory of [(Z)\vec]C(2)²{\vec Z}C(2)^2-lattices is decidable. 91-104
  Electronic Edition (link) BibTeX
• Lars Kristiansen:
  A jump operator on honest subrecursive degrees. 105-125
  Electronic Edition (link) BibTeX
• Carlo Toffalori:
  The decision problem for [(Z)\vec]C(p³){\vec Z}C(p^3)-lattices with pp prime. 127-142
  Electronic Edition (link) BibTeX

Volume 37, Number 3, April 1998

• Thierry Coquand:
  Two applications of Boolean models. 143-147
  Electronic Edition (link) BibTeX
• Toshiyasu Arai:
  Consistency proof via pointwise induction. 149-165
  Electronic Edition (link) BibTeX
• Frank Wolter:
  All finitely axiomatizable subframe logics containing the provability logic CSM ₀_{0} are decidable. 167-182
  Electronic Edition (link) BibTeX
• Jörg Brendle:
  Mob families and mad families. 183-197
  Electronic Edition (link) BibTeX
• Wolfgang Burr, Volker Hartung:
  A characterization of the S₁\Sigma_1-definable functions of KPw+ (uniform AC)KP\omega + (uniform\; AC). 199-214
  Electronic Edition (link) BibTeX

Volume 37, Number 4, June 1998

• Enrique Casanovas:
  A test for expandability. 221-234
  Electronic Edition (link) BibTeX
• Jeremy Avigad:
  An effective proof that open sets are Ramsey. 235-240
  Electronic Edition (link) BibTeX
• Lorenz Halbeisen:
  Symmetries between two Ramsey properties. 241-260
  Electronic Edition (link) BibTeX
• Yoshihiro Abe:
  Combinatorial characterization of P¹₁\Pi^1_1-indescribability in P_klP_{\kappa}\lambda. 261-272
  Electronic Edition (link) BibTeX

Volume 37, Numbers 5-6, July 1998

• Gerhard Jäger, Wolfram Pohlers, Stanley S. Wainer:
  Editorial Logic Colloquium '95, Haifa, Israel. 273
  Electronic Edition (link) BibTeX
• Lev D. Beklemishev:
  A proof-theoretic analysis of collection. 275-296
  Electronic Edition (link) BibTeX
• Matthias Baaz, Richard Zach:
  Note on generalizing theorems in algebraically closed fields. 297-307
  Electronic Edition (link) BibTeX
• G. Bellin, A. Fleury:
  Planar and braided proof-nets for multiplicative linear logic with mix. 309-325
  Electronic Edition (link) BibTeX
• Wil Dekkers, Martin W. Bunder, Henk Barendregt:
  Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus. 327-341
  Electronic Edition (link) BibTeX
• Mariagnese Giusto, Alberto Marcone:
  Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic. 343-362
  Electronic Edition (link) BibTeX
• Ulrich Kohlenbach:
  Elimination of Skolem functions for monotone formulas in analysis. 363-390
  Electronic Edition (link) BibTeX
• Markus Marzetta, Thomas Strahm:
  The m\mu quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals. 391-413
  Electronic Edition (link) BibTeX
• Grigori Mints:
  Normal deduction in the intuitionistic linear logic. 415-425
  Electronic Edition (link) BibTeX
• Andreas Weiermann:
  Bounding derivation lengths with functions from the slow growing hierarchy. 427-441
  Electronic Edition (link) BibTeX

Volume 37, Number 7, October 1998

• Karl-Heinz Niggl:
  A restricted computation model on Scott domains and its partial primitive recursive functionals. 443-481
  Electronic Edition (link) BibTeX
• Simon Thomas:
  Groupwise density and the cofinality of the infinite symmetric group. 483-493
  Electronic Edition (link) BibTeX
• Heike Mildenberger, Otmar Spinas:
  Meeting infinitely many cells of a partition once. 495-503
  Electronic Edition (link) BibTeX

Volume 37, Number 8, November 1998

• Benedikt Löwe:
  Uniform unfolding and analytic measurability. 505-520
  Electronic Edition (link) BibTeX
• Marcus Schaefer:
  A guided tour of minimal indices and shortest descriptions. 521-548
  Electronic Edition (link) BibTeX