17 research outputs found

    Forcing lightface definable well-orders without the CGH

    Get PDF
    For any given uncountable cardinal κ\kappa with κ<κ=κ\kappa^{{<}\kappa}=\kappa, we present a forcing that is <κ<\kappa-directed closed, has the κ+\kappa^+-c.c. and introduces a lightface definable well-order of H(κ+)H(\kappa^+). We use this to define a global iteration that does this for all such κ\kappa simultaneously and is capable of preserving the existence of many large cardinals in the universe

    Set Theory

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

    Maximal sets without Choice

    Full text link
    We show that it is consistent relative to ZF, that there is no well-ordering of R\mathbb{R} while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we can assume that every projective hypergraph on R\mathbb{R} has a maximal independent set, among a few other things. For example, we get transversals for all projective equivalence relations. Moreover, this is possible while either DCω1\mathsf{DC}_{\omega_1} holds, or countable choice for reals fails. Assuming the consistency of an inaccessible cardinal, "projective" can even be replaced with "L(R)L(\mathbb{R})". This vastly strengthens earlier consistency results in the literature.Comment: 16 page

    Mathematical Logic and Its Applications 2020

    Get PDF
    The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021

    Amalgamation, absoluteness, and categoricity

    Get PDF
    "Vegeu el resum a l'inici del document del fitxer adjunt"

    Indeterminateness and `The' Universe of Sets: Multiversism, Potentialism, and Pluralism

    Get PDF
    In this article, I survey some philosophical attitudes to talk concerning `the' universe of sets. I separate out four different strands of the debate, namely: (i) Universism, (ii) Multiversism, (iii) Potentialism, and (iv) Pluralism. I discuss standard arguments and counterarguments concerning the positions and some of the natural mathematical programmes that are suggested by the various views

    Easton supported Jensen coding and projective measure without projective Baire

    Full text link
    We prove that it is consistent relative to a Mahlo cardinal that all sets of reals definable from countable sequences of ordinals are Lebesgue measurable, but at the same time, there is a Δ31\Delta^1_3 set without the Baire property. To this end, we introduce a notion of stratified forcing and stratified extension and prove an iteration theorem for these classes of forcings. Moreover we introduce a variant of Shelah's amalgamation technique that preserves stratification. The complexity of the set which provides a counterexample to the Baire property is optimal.Comment: 142 page
    corecore