Archive for Mathematical Logic, Volume 39

Volume 39, Number 1, January 2000

• Michael Rathjen:
  The strength of Martin-Löf type theory with a superuniverse. Part I. 1-39
  
• Yi Zhang:
  Maximal cofinitary groups. 41-52
  
• Thierry Coquand, Erik Palmgren:
  Intuitionistic choice and classical logic. 53-74
  

Volume 39, Number 2, February 2000

• Yasuo Kanai:
  On completeness of the quotient algebras P(k)/I{\cal P}(\kappa)/I. 75-87
  
• Tapani Hyttinen:
  On stability in finite models. 89-102
  
• Francesc Esteva, Lluis Godo, Petr Hájek, Mirko Navara:
  Residuated fuzzy logics with an involutive negation. 103-124
  
• Reinhard Kahle:
  N\hbox{\sf N}-strictness in applicative theories. 125-144
  

Volume 39, Number 3, April 2000

• Shamil Ishmukhametov:
  On relative enumerability of Turing degrees. 145-154
  
• Anton Setzer:
  Extending Martin-Löf Type Theory by one Mahlo-universe. 155-181
  
• Lauri Hella, Juha Nurmonen:
  Vectorization hierarchies of some graph quantifiers. 183-207
  
• Arthur W. Apter:
  A new proof of a theorem of Magidor. 209-211
  
• Menachem Kojman, Saharon Shelah:
  The PCF Trichotomy Theorem does not hold for short sequences. 213-218
  
• Paul Corazza:
  Consistency of V = HOD with the wholeness axiom. 219-226
  

Volume 39, Number 4, May 2000

• Kai Hauser:
  Generic relativizations of fine structure. 227-251
  
• Arthur W. Apter:
  On a problem of Woodin. 253-259
  
• Karim Nour:
  Mixed logic and storage operators. 261-280
  
• Angsheng Li:
  On a conjecture of Lempp. 281-309
  

Volume 39, Number 5, July 2000

• Angsheng Li:
  Bounding cappable degrees. 311-352
  
• Toshiyasu Arai:
  Ordinal diagrams for recursively Mahlo universes. 353-391
  

Volume 39, Number 6, August 2000

• Joan Bagaria:
  Bounded forcing axioms as principles of generic absoluteness. 393-401
  
• Vladimir Kanovei, Michael Reeken:
  A nonstandard set theory in the Î\displaystyle\in-language. 403-416
  
• Ivan N. Soskov:
  A jump inversion theorem for the enumeration jump. 417-437
  
• Rami P. Grossberg, Olivier Lessmann:
  Local order property in nonelementary classes. 439-457
  
• Charalampos Cornaros, Costas Dimitracopoulos:
  A note on end extensions. 459-463
  
• J. Vickers, Philip D. Welch:
  On successors of Jónsson cardinals. 465-473
  

Volume 39, Number 7, October 2000

• Arnold Beckmann, Andreas Weiermann:
  Characterizing the elementary recursive functions by a fragment of Gödel's T. 475-491
  
• Gerhard Jäger, Thomas Strahm:
  Fixed point theories and dependent choice. 493-508
  
• James H. Schmerl:
  Elementary extensions of models of set theory. 509-514
  
• Karl-Heinz Niggl:
  The m\mu-measure as a tool for classifying computational complexity. 515-539
  
• Paul Larson:
  The size of [(T)\tilde]\tilde{T}. 541-568
  

Volume 39, Number 8, November 2000

• Jeffry L. Hirst:
  Reverse mathematics and rank functions for directed graphs. 569-579
  
• Arief Daynes:
  A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation. 581-598
  
• Wolfgang Burr:
  A Diller-Nahm-style functional interpretation of KP w\hbox{\sf KP} \omega. 599-604
  
• L. R. Galminas:
  A computably enumerable vector space with the strong antibasis property. 605-629