Archive for Mathematical Logic, Volume 36

Volume 36, Number 1, December 1996

• Decheng Ding, Lei Qian:
  Isolated d.r.e. degrees are dense in r.e. degree structure. 1-10
  Electronic Edition (link) BibTeX
• Arnold Beckmann, Andreas Weiermann:
  A term rewriting characterization of the polytime functions and related complexity classes. 11-30
  Electronic Edition (link) BibTeX
• Ulrich Kohlenbach:
  Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. 31-71
  Electronic Edition (link) BibTeX
• Roman Kossak, Nicholas Bamber:
  On two questions concerning the automorphism groups of countable recursively saturated models of PA. 73-79
  Electronic Edition (link) BibTeX

Volume 36, Number 2, February 1997

• Saharon Shelah:
  Set theory without choice: not everything on cofinality is possible. 81-125
  Electronic Edition (link) BibTeX
• Joachim Schmid:
  Existentially closed fields with holomorphy rings. 127-135
  Electronic Edition (link) BibTeX
• Haim Judah, Otmar Spinas:
  Large cardinals and projective sets. 137-155
  Electronic Edition (link) BibTeX

Volume 36, Number 3, April 1997

• Søren Riis:
  Count( qq) versus the pigeon-hole principle. 157-188
  Electronic Edition (link) BibTeX
• Stefano Baratella, Stefano Berardi:
  A parallel game semantics for Linear Logic. 189-217
  Electronic Edition (link) BibTeX
• Dag Normann:
  Hereditarily effective typestreams. 219-225
  Electronic Edition (link) BibTeX

Volume 36, Numbers 4-5, August 1997

• Richard A. Shore:
  Conjectures and questions from Gerald Sacks's Degrees of Unsolvability. 233-253
  Electronic Edition (link) BibTeX
• Theodore A. Slaman, W. Hugh Woodin:
  Definability in the enumeration degrees. 255-267
  Electronic Edition (link) BibTeX
• Dag Normann:
  Closing the gap between the continuous functionals and recursion in ³E. 269-287
  Electronic Edition (link) BibTeX
• Colin G. Bailey:
  Relativized projecta and b\beta-r.e. sets. 289-296
  Electronic Edition (link) BibTeX
• Steffen Lempp, Manuel Lerman:
  Iterated trees of strategies and priority arguments. 297-312
  Electronic Edition (link) BibTeX
• Jim Owings:
  Rank, join, and Cantor singletons. 313-320
  Electronic Edition (link) BibTeX
• Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
  On the parameterized complexity of short computation and factorization. 321-337
  Electronic Edition (link) BibTeX
• V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
  Nonmonotonic rule systems with recursive sets of restraints. 339-384
  Electronic Edition (link) BibTeX

Volume 36, Number 6, October 1997

• Yoshihiro Abe:
  A hierarchy of filters smaller than CF_kappalambda. 385-397
  Electronic Edition (link) BibTeX
• Maxim R. Burke:
  A proof of Hechler's theorem on embedding Aleph₁-directed sets cofinally into (w^w, <^*). 399-403
  Electronic Edition (link) BibTeX
• Lill Kristiansen, Dag Normann:
  Total objects in inductively defined types. 405-436
  Electronic Edition (link) BibTeX
• Makoto Kikuchi:
  Kolmogorov complexity and the second incompleteness theorem. 437-443
  Electronic Edition (link) BibTeX
• Andreas Weiermann:
  A proof of strongly uniform termination for Gödel's TT by methods from local predicativity. 445-460
  Electronic Edition (link) BibTeX
• Karim Nour:
  La valeur d'un entier classique en lm\lambda\mu-calcul. 461-473
  Electronic Edition (link) BibTeX