We continue the exposition on self-genericity axioms for ideals on P(Z) (Club Catch, Projective Catch and Stationary Catch). We establish some relations with forcing axioms and with the existence of certain regular forcing embeddings, and also point out connections with Precipitousness. In particular we observe that if Projective Catch holds for an ideal, then that ideal is precipitous, and the converse holds for ideals that concentrate on countable sets. Finally we give an overview of the method used for proving the existence of models with Woodin cardinals coming from these axioms, using the Core Model Theory.
We continue the exposition on self-genericity axioms for ideals on P(Z) (Club Catch, Projective Catch and Stationary Catch). We establish some relations with forcing axioms and with the existence of certain regular forcing embeddings, and also point out connections with Precipitousness. In particular we observe that if Projective Catch holds for an ideal, then that ideal is precipitous, and the converse holds for ideals that concentrate on countable sets. Finally we give an overview of the method used for proving the existence of models with Woodin cardinals coming from these axioms, using the Core Model Theory.
Let \Gamma be a definable class of forcing posets and \kappa be a cardinal. We define MP(\kappa,\Gamma) to be the statement:
"For any A\subseteq \kappa, any formula \phi(v), for any P \in \Gamma, if there is a name \dot{Q} such that V^P models "\dot{Q}\in \Gamma + dot{Q} forces that \phi[A] is necessary" then V models \phi[A],"
where a poset Q \in \Gamma forces a statement \phi(x) to be necessary if for any \dot{R} such that V^Q \vDash \dot{R} \in \Gamma, then V^{Q\star \dot{R}} models \phi(x). When \Gamma is the class of proper forcings (or semi-proper forcings, or stationary set preserving forcings), we show that MP(\omega_1,\Gamma) is consistent relative to large cardinals. We also discuss the consistency strength of these principles as well as their relationship with forcing axioms. These are variants of maximality principles defined by Hamkins. This is joint work with Daisuke Ikegami.
The tree property arises as the generalization of Koenig's infinity lemma to an uncountable cardinal. The existence of an uncountable cardinal with the tree property has axiomatic strength beyond the axioms of ZFC. Indeed a theorem of Mitchell shows that the theory ZFC + ``omega_2 has the tree property" is consistent if and only if the theory ZFC + ``There is a weakly compact cardinal" is consistent. In the context of Mitchell's theorem, we can ask an old question in set theory: Is it consistent that every regular cardinal greater than aleph_1 has the tree property? In this talk we will survey the best known partial results towards a positive answer to this question.
It is open whether \Pi^1_1 determinacy implies the existence of 0^\# in 3rd order arithmetic, call it Z_3. We compute the large cardinal strength of Z_3 plus "there is a real x such that every x-admissible is an L-cardinal." This is joint work with Yong Cheng.
In this talk we introduce "self-genericity" axioms. Fixing an ideal I, we define the notion of "M is self-generic" (w.r.t I), where M is an elementary substructure of an initial segment of the universe, and consider several axioms asserting that these structures are frequent: Club Catch, Projective Catch and Stationary Catch (in decreasing order of strength). In particular, we show that Club Catch is equivalent to saturation. We also state some known consistency results related to these axioms, and note some connections with generic embeddings.
We continue with the presentation of two different ways to generically add a club subset of a successor cardinal, under some GCH. The first one is designed to destroy a given stationary set, and we show that it also forces diamond. The second adds a club with "small" conditions and destroys saturated ideals. We will discuss the open problem of whether this can be done without any cardinal arithmetic assumptions.
We will present two different ways to generically add a club subset of a successor cardinal, under some GCH. The first one is designed to destroy a given stationary set, and we show that it also forces diamond. The second adds a club with "small" conditions and destroys saturated ideals. We will discuss the open problem of whether this can be done without any cardinal arithmetic assumptions.
The talk will consist of two loosely connected parts: set-theoretic and computer science. We give an overview (no technical details) of our results on Galois-Tukey connections as a general framework for problem reduction. Boolean structure of absolutely divergent series gives rise to several Boolean-like asymptotic structures. Second part deals with applications of many valued logic to preference modeling, querying top-k answers and learning each individual user preferences from behaviour data (especially we mention lack of real world benchmarks).
This talk looks at the relationship between three foundational systems: Goedel's Constructible Universe of Sets, the naive conception of set found in consistent fragments of Frege's Grundgesetze, and the intensional logic of Church's Logic of Sense and Denotation. One basic result shows how to use the constructible sets to build models of fragments of Frege's Grundgesetze from which one can recover these very constructible sets using Frege's definition of membership. This result also allows us to solve the related consistency problem and joint consistency problems for abstraction principles with limited amounts of comprehension. Another basic aim of this paper is to show how to "factor'' this result via a consistent fragment of Church's Logic of Sense and Denotation: so one may use the constructible sets to build models of Church's Logic of Sense and Denotation, from which one may then define models of the consistent fragments of Frege's Grundgesetze.
Preprint: https://www.dropbox.com/s/afhcz8bzy4pdsoc/walsh-sean-CU%2BNC%2BIL-11-19-...