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
Electronic Edition (link) BibTeX
Yi Zhang:
Maximal cofinitary groups. 41-52
Electronic Edition (link) BibTeX
Thierry Coquand, Erik Palmgren:
Intuitionistic choice and classical logic. 53-74
Electronic Edition (link) BibTeX

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

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

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

Angsheng Li:
Bounding cappable degrees. 311-352
Electronic Edition (link) BibTeX
Toshiyasu Arai:
Ordinal diagrams for recursively Mahlo universes. 353-391
Electronic Edition (link) BibTeX

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

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

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