2001-01-22Martin Goldstern (TU Wien)Gödel Logics, Scattered Orders and BQO's
2001-03-13David Aspero (KGRC)Bounded Martin's Maximum
2001-03-20David Aspero (KGRC)The Bounded Martin's Maximum and $\psi_{AC}$(2)
2001-03-27Ralf Schindler (KGRC)Absorbing iterations of the universe
2001-04-02Sy Friedman (KGRC)Genericity and Large Cardinals
2001-04-24Dorshka Wylie (City University of New York)Fragments in a Lower Core Model
2001-05-08Sy Friedman (KGRC)Genericity and Large Cardinals, Part 2
2001-05-15Heike Mildenberger (KGRC)Forcing with trees of creatures (1)
2001-05-22Heike Mildenberger (KGRC)Forcing with trees of creatures (2)
2001-06-12Ralf Schindler (KGRC)K^c without large cardinals in V
2001-06-19Ralf Schindler (KGRC)P not= NP for infinite time Turing machines.
2001-06-27Philip D. Welch (KGRC)Higher type recursion in Infinite Time Turing Machines
2001-08-25Ralf Schindler (KGRC)Bounded Forcing Axioms and Sets of Reals
2001-10-18Rene Schipperus (KGRC)The Topological Baumgartner-Hajnal Theorem
2001-11-15Philip Welch (KGRC)More on BMM and related reflection properties
2001-11-22David Aspero (KGRC)More on a convenient property for $[\gamma]^{\aleph_0}$
2001-11-29Heike Mildenberger (KGRC)Canonization Theorems
2001-12-13Arnold Beckmann (TU Wien, Uni Münster)Some words on well-foundedness principles over definable sets
Well-foundedness principles are used in the definition of proof theoretic ordinals. If the 2nd order quantification in this definition is restricted to definable sets (e.g. arithmetical sets in case of Peano Arithmetic) we obtain "pathological" proof theoretic ordinals by a result of Kreisel. Does the situation differ for other pairs of theories and definable sets? Or, is there a way out of this misery?