datespeakertitle
2000-03-07Arthur Apter (City University of New York)Indestructibility and the Level by Level Equivalence between Strong Compactness and Supercompactness
2000-03-14Sy Friedman (KGRC)Inner Models and 0#
2000-03-21Peter Koepke (Universität Bonn)Ordinal Functions
2000-04-04Martin Goldstern (TU Wien)Clones on regular cardinals
A clone on a set X is a set of functions (on any finite arity) which is closed under composition (e.g., f(x,y) and g(x,y) are in the clone, then also g(f(x,z), f(z, y)) is in the clone.) The set of clones on X forms a complete algebraic lattice. I will present some results about this lattice for two cases:

* |X| is a weakly compact cardinal (or aleph_0) * |X| is a successor of a regular cardinal. In this case we can use a strong negative partition relation to get a "nonstructure" result.

(These are results from a joint paper with Shelah, GoSh:747)

2000-04-11Ralf Schindler (KGRC)Steels Theorem über projektive Uniformisierbarkeit
2000-05-09Sy Friedman (KGRC)Cardinal-preserving extensions
2000-05-12Alessandro Andretta (University of Turin)Descriptive Set Theory and Wadge Degrees
2000-05-16Alessandro Andretta (University of Turin)Descriptive Set Theory and Wadge Degrees
2000-05-19Alessandro Andretta (University of Turin)Descriptive Set Theory and Wadge Degrees
2000-06-06Riccardo Camerlo (KGRC)Classical descriptive set theory
2000-06-09Tomek Bartoszynski (Boise State University, Rutgers University)Perfectly meager sets
A set of reals X is perfectly meager if X is meager inside every perfect set P. Uncountable perfectly meager sets can be constructed in ZFC. In 1935 Marczewski asked if the product of perfectly meager sets is perfectly meager. In this talk I will discuss the answer to this question given by the following two theorems.

Theorem (Reclaw 1990) "No" is consistent with ZCF.

Theorem (T.B. 2000) "Yes" is consistent with ZCF.

2000-10-03Sy Friedman (KGRC)Seven Topics in Pure Set Theory
2000-10-10Ralf Schindler (KGRC)Almost Linear Iterations
2000-10-17Ralf Schindler (KGRC)Almost Linear Iterations, Part 2
2000-10-17Ralf Schindler (KGRC)Almost Linear Iterations, Part 3
2000-10-31Riccardo Camerlo (KGRC)The relation of recursive isomorphism for countable structures
2000-11-07Riccardo Camerlo (KGRC)The relation of recursive isomorphism for countable structures, Part 2
2000-11-17Mladen Pavicic (University of Zagreb)Classical logic models
A well-known ortholattice model of classical propositional logic is the Boolean algebra (a distributive ortholattice, which is therefore orthomodular as well). In this talk I will show that there is also another ortholattice model of classical propositional logic which is neither distributive nor orthomodular so that classical propositional logic turns out to be non-categorical. I give the soundness and completeness proofs for the new model and compare them with those for the Boolean algebra.

2000-11-21Martin Zeman (KGRC)Combinatorial principles in inner models
2000-11-24Lorenz Halbeisen (Universität Basel)Partition-ultrafilters
The talk will be about some topological properties of the space of partition-ultrafilters as well as about some special partition-ultrafilters, like a partitioned version of Ramsey ultrafilters.

2000-11-28Philip Welch (KGRC)On Belnap-Gupta Revision Theories of Truth, the Next Stable Set and Kripkean Fixed Points
2000-12-05Alberto Marcone (University of Udine, Italy)WQO and BQO theory in subsystems of second order arithmetic
2000-12-11Joan Bagaria (University of Barcelona, Spain)Natural axioms of Set Theory that settle Cantor's Continuum problem