Volume 40, Number 1, January 2001
Volume 40, Number 2, February 2001
Volume 40, Number 3, April 2001
- Alex M. McAllister:
Computability in structures representing a Scott set.
- Birgit Elbl:
Cut elimination for a calculus with context-dependent rules.
- Jean-Louis Krivine:
Typed lambda-calculus in classical Zermelo-Frænkel set theory.
- Michael Rathjen:
The strength of Martin-Löf type theory with a superuniverse. Part II.
- Todd Eisworth:
Near coherence and filter games.
Volume 40, Number 4, May 2001
- J. Donald Monk:
The spectrum of partitions of a Boolean algebra.
- Wilfried Buchholz:
Explaining the Gentzen-Takeuti reduction steps: a second-order system.
- Ali Enayat:
Trees and Keislers problem.
- Albert Visser:
Submodels of Kripke models.
- Alexandra Shlapentokh:
Diophantine definability over non-finitely generated non-degenerate modules of algebraic extensions of Q.
Volume 40, Number 5, July 2001
Volume 40, Number 6, August 2001
Volume 40, Number 7, October 2001
- Silvio Valentini:
An elementary proof of strong normalization for intersection types.
- Frank Stephan:
On one-sided versus two-sided classification.
- Francis Oger:
Axiomatization of abelian-by-G groups for a finite group G.
- Thierry Coulbois:
The class of groups which have a subgroup of index 2 is not elementary.
- Françoise Point:
On the definability of verbal subgroups.
- Arthur W. Apter, Mirna Dzamonja:
Some remarks on a question of D. H. Fremlin regarding epsilon-density.
- Jan von Plato:
Natural deduction with general elimination rules.
Volume 40, Number 8, November 2001
Last update Thu May 23 18:15:28 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page