Volume 66, Number 1, March 2001
Jacques Duparc:
Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank.
56-86
Koichiro Ikeda:
Minimal But Not Strongly Minimal Structures with Arbitrary Finite Dimensions.
117-126
Reed Solomon:
PI11-CA0 and Order Types of Countable Ordered Groups.
192-206
Vera Puninskaya:
Modules with Few Types over A Hereditary Noetherian Prime Ring.
271-280
Rosalie Iemhoff:
On The Admissible Rules of Intuitionistic Propositional Logic.
281-294
Benoît Mariou:
Modèles Saturés et Modèles Engendrés Par des Indiscernables.
325-348
Paul C. Gilmore:
An Intensional Type Theory: Motivation and Cut-Elimination.
383-400
Su Gao:
A Remark on Martin's Conjecture.
401-406
Volume 66, Number 2, June 2001
Dan E. Willard:
Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles.
536-596
Andreas Weiermann:
Some Interesting Connections Between The Slow Growing Hierarchy and The Ackermann Function.
609-628
Arthur W. Apter:
Supercompactness and Measurable Limits of Strong Cardinals.
629-639
Martin Otto:
Two Variable First-Order Logic over Ordered Domains.
685-702
Anand Pillay:
A Note on Existentially Closed Difference Fields with Algebraically Closed Fixed Field.
719-721
Frank Stephan:
On The Structures Inside Truth-Table Degrees.
731-770
Su Gao:
Some Dichotomy Theorems for Isomorphism Relations of Countable Models.
902-922
Eberhard Herrmann:
Infinite Chains and Antichains in Computable Partial Orderings.
923-934
Renling Jin:
Existence of Some Sparse Sets of Nonstandard Natural Numbers.
959-973
Volume 66, Number 3, September 2001
Mark Reynolds:
An Axiomatization of Full Computation Tree Logic.
1011-1057
Greg Hjorth:
A Boundedness Lemma for Iterations.
1058-1072
Gerhard Jäger:
First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo.
1073-1089
J. Todd Wilson:
An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered.
1121-1126
Daniel Pitteloud:
Existence of Prime Elements in Rings of Generalized Power Series.
1206-1216
Philp Ehrlich:
Number Systems with Simplicity Hierarchies: A Generalization of Conway's Theory of Surreal Numbers.
1231-1258
Arnold Beckmann:
Exact Bounds for Lengths of Reductions in Typed lambda-Calculus.
1277-1285
Jan Kraszewski:
Properties of Ideals on The Generalized Cantor Spaces.
1303-1320
Francis Oger:
Elementary Equivalence for Abelian-By-Finite and Nilpotent Groups.
1471-1480
Ingo Brigandt:
Quantifier Elimination in Tame Infinite p-ADIC Fields.
1493-1503
Volume 66, Number 4, December 2001
Timothy McNicholl:
On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets.
1543-1560
Bruno Poizat:
Quelques Modestes Remarques A Propos D'Une Conséquence Inattendue D'Un Résultat Surprenant de Monsieur Frank Olaf Wagner.
1637-1646
J. Zashev:
On The Recursion Theorem in Iterative Operative Spaces.
1727-1748
Ali Enayat:
Power-Like Models of Set Theory.
1766-1782
Joseph Johns:
An Open Mapping Theorem for O-Minimal Structures.
1817-1836
Sergei Tupailo:
Realization of Analysis into Explicit Mathematics.
1848-1864
Timothy Bays:
Partitioning Subsets of Stable Models.
1899-1908
José Iovino:
On The Maximality of Logics with Approximations.
1909-1918
Arthur W. Apter:
Some Structural Results Concerning Supercompact Cardinals.
1919-1927
J. Donald Monk:
Continuum Cardinals Generalized to Boolean Algebras.
1928-1958
data released under the ODC-BY 1.0 license
