Determinacy of refinements to the difference hierarchy of co-analytic sets

In this paper we develop a technique for proving determinacy of classes of the form ω²-Π¹₁+Γ (a refinement of the difference hierarchy on Π¹₁ lying between ω²-Π¹₁ and (ω²+1)-Π¹₁) from weak principles, establishing upper bounds for the determinacy- strength of the classes ω²-Π¹₁+Σ^0_α for all computable α and of ω²-Π¹₁+Δ¹₁. This bridges the gap between previously known hypotheses implying determinacy in this region

Set Theory

This workshop included selected talks on pure set theory and its applications, simultaneously showing diversity and coherence of the subject

The Structure of Models of Second-order Set Theories

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories. The main results are the following, organized by chapter. First, I investigate the poset of T-realizations of a fixed countable model of ZFC, where T is a reasonable second-order set theory such as GBC or KM, showing that it has a rich structure. In particular, every countable partial order embeds into this structure. Moreover, we can arrange so that these embedding preserve the existence/nonexistence of upper bounds, at least for finite partial orders. Second I generalize some constructions of Marek and Mostowski from KM to weaker theories. They showed that every model of KM plus the Class Collection schema “unrolls” to a model of ZFC− with a largest cardinal. I calculate the theories of the unrolling for a variety of second-order set theories, going as weak as GBC + ETR. I also show that being T-realizable goes down to submodels for a broad selection of second-order set theories T. Third, I show that there is a hierarchy of transfinite recursion principles ranging in strength from GBC to KM. This hierarchy is ordered first by the complexity of the properties allowed in the recursions and second by the allowed heights of the recursions. Fourth, I investigate the question of which second-order set theories have least models. I show that strong theories—such as KM or Π11-CA—do not have least transitive models while weaker theories—from GBC to GBC + ETROrd —do have least transitive models

The Structure of Models of Second-order Set Theories

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories. The main results are the following, organized by chapter. First, I investigate the poset of $T$-realizations of a fixed countable model of $\mathsf{ZFC}$, where $T$ is a reasonable second-order set theory such as $\mathsf{GBC}$ or $\mathsf{KM}$, showing that it has a rich structure. In particular, every countable partial order embeds into this structure. Moreover, we can arrange so that these embedding preserve the existence/nonexistence of upper bounds, at least for finite partial orders. Second I generalize some constructions of Marek and Mostowski from $\mathsf{KM}$ to weaker theories. They showed that every model of $\mathsf{KM}$ plus the Class Collection schema "unrolls" to a model of $\mathsf{ZFC}^-$ with a largest cardinal. I calculate the theories of the unrolling for a variety of second-order set theories, going as weak as $\mathsf{GBC} + \mathsf{ETR}$. I also show that being $T$-realizable goes down to submodels for a broad selection of second-order set theories $T$. Third, I show that there is a hierarchy of transfinite recursion principles ranging in strength from $\mathsf{GBC}$ to $\mathsf{KM}$. This hierarchy is ordered first by the complexity of the properties allowed in the recursions and second by the allowed heights of the recursions. Fourth, I investigate the question of which second-order set theories have least models. I show that strong theories---such as $\mathsf{KM}$ or $\Pi^1_1\text{-}\mathsf{CA}$---do not have least transitive models while weaker theories---from $\mathsf{GBC}$ to $\mathsf{GBC} + \mathsf{ETR}_\mathrm{Ord}$---do have least transitive models.Comment: This is my PhD dissertatio

The prospects for mathematical logic in the twenty-first century

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.Comment: Association for Symbolic Logi

Stably Measurable Cardinals

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second uniform indiscernible for bounded subsets of $\kappa$: $u_2(\kappa)$, and secondly to give the consistency strength of a property of L\"ucke's. Theorem: The following are equiconsistent: (i) There exists $\kappa$ which is stably measurable; (ii) for some cardinal $\kappa$, $u_2(\kappa)=\sigma(\kappa)$; (iii) The {\boldmath $\Sigma_1$}-club property holds at a cardinal $\kappa$. Here $\sigma(\kappa)$ is the height of the smallest $M \prec_{\Sigma_1} H(\kappa^+)$ containing $\kappa+1$ and all of $H(\kappa)$

A predicative variant of a realizability tripos for the Minimalist Foundation.

open2noHere we present a predicative variant of a realizability tripos validating the intensional level of the Minimalist Foundation extended with Formal Church thesis.the file attached contains the whole number of the journal including the mentioned pubblicationopenMaietti, Maria Emilia; Maschio, SamueleMaietti, MARIA EMILIA; Maschio, Samuel

Stationary set preserving L-forcings and the extender algebra

Wir konstruieren das Jensensche L-Forcing und nutzen dieses um die Pi_2 Konsequenzen der Theorie ZFC+BMM+"das nichtstationäre Ideal auf omega_1 ist abschüssig" zu studieren. Viele natürliche Konsequenzen der Theorie ZFC+MM folgen schon aus dieser schwächeren Theorie. Wir geben eine neue Charakterisierung des Axioms Dagger ("Alle Forcings welche stationäre Teilmengen von omega_1 bewahren sind semiproper") in dem wir eine Klasse von L-Forcings isolieren deren Semiproperness äquivalent zu Dagger ist. Wir verallgemeinern ein Resultat von Todorcevic: wir zeigen, dass Rado's Conjecture Dagger impliziert. Des weiteren studieren wir Generizitätsiterationen im Kontext einer messbaren Woodinzahl. Mit diesem Werkzeug erhalten wir eine Verallgemeinerung des Woodinschen Sigma^2_1 Absolutheitstheorems. We review the construction of Jensen's L-forcing which we apply to study the Pi_2 consequences of the theory ZFC + BMM + "the nonstationary ideal on omega_1 is precipitous". Many natural consequences ZFC + MM follow from this weaker theory. We give a new characterization of the axiom dagger ("All stationary set preserving forcings are semiproper") by isolating a class of stationary set preserving L-forcings whose semiproperness is equivalent to dagger. This characterization is used to generalize work of Todorcevic: we show that Rado's Conjecture implies dagger. Furthermore we study genericity iterations beginning with a measurable Woodin cardinal. We obtain a generalization of Woodin's Sigma^2_1 absoluteness theorem

Computability Theory (hybrid meeting)

Over the last decade computability theory has seen many new and fascinating developments that have linked the subject much closer to other mathematical disciplines inside and outside of logic. This includes, for instance, work on enumeration degrees that has revealed deep and surprising relations to general topology, the work on algorithmic randomness that is closely tied to symbolic dynamics and geometric measure theory. Inside logic there are connections to model theory, set theory, effective descriptive set theory, computable analysis and reverse mathematics. In some of these cases the bridges to seemingly distant mathematical fields have yielded completely new proofs or even solutions of open problems in the respective fields. Thus, over the last decade, computability theory has formed vibrant and beneficial interactions with other mathematical fields. The goal of this workshop was to bring together researchers representing different aspects of computability theory to discuss recent advances, and to stimulate future work