In this article we give a forcing characterization for the Ramsey property of Σ 1 2 -sets of reals. This research was motivated by the well-known forcing characterizations for Lebesgue measurability and the Baire property of Σ 1 2 -sets of reals. Further we will show the relationship between higher degrees of forcing absoluteness and the Ramsey property of projective sets of reals.

Bourbaki suggest that their definition of the number 1 runs to some tens of thousands of symbols. We show that that is a considerable under-estimate, the true number of symbols being that in the title, not counting 1 179 618 517 981 links between symbols that are needed to disambiguate the whole expression.

We derive the schemes of from certain weak forms of the same.

Bourbaki suggest that their definition of the number 1 runs to some tens of thousands of symbols. We show that that is a considerable under-estimate, the true number of symbols being that in the title, not counting 1 179 618 517 981 links between symbols that are needed to disambiguate the whole expression.

We prove the existence of p-ideals that are nonmeagre subsets of P(ω) under various set-theoretic assumptions.

Saunders Mac Lane has drawn attention many times, particularly in his book Mathematics: Form and Function, to the system of set theory of which the axioms are Extensionality, Null Set, Pairing, Union, Infinity, Power Set, Restricted Separation, Foundation, and Choice, to which system, afforced by the principle, , of Transitive Containment, we shall refer as . His system is naturally related to systems derived from topos-theoretic notions concerning the category of sets, and is, as Mac Lane emphasises, one that is (...) adequate for much of mathematics. In this paper we show that the consistency strength of Mac Lane's system is not increased by adding the axioms of Kripke–Platek set theory and even the Axiom of Constructibility to Mac Lane's axioms; our method requires a close study of Axiom H, which was proposed by Mitchell; we digress to apply these methods to subsystems of Zermelo set theory , and obtain an apparently new proof that is not finitely axiomatisable; we study Friedman's strengthening of , and the Forster–Kaye subsystem of , and use forcing over ill-founded models and forcing to establish independence results concerning and ; we show, again using ill-founded models, that proves the consistency of ; turning to systems that are type-theoretic in spirit or in fact, we show by arguments of Coret and Boffa that proves a weak form of Stratified Collection, and that is a conservative extension of for stratified sentences, from which we deduce that proves a strong stratified version of ; we analyse the known equiconsistency of with the simple theory of types and give Lake's proof that an instance of Mathematical Induction is unprovable in Mac Lane's system; we study a simple set theoretic assertion—namely that there exists an infinite set of infinite sets, no two of which have the same cardinal—and use it to establish the failure of the full schema of Stratified Collection in ; and we determine the point of failure of various other schemata in . The paper closes with some philosophical remarks. (shrink)

Working in Z + KP, we give a new proof that the class of hereditarily finite sets cannot be proved to be a set in Zermelo set theory, extend the method to establish other failures of replacement, and exhibit a formula Φ(λ, a) such that for any sequence $\langle A_{\lambda} \mid \lambda \text{a limit ordinal} \rangle$ where for each $\lambda, A_{\lambda} \subseteq ^{\lambda}2$ , there is a supertransitive inner model of Zermelo containing all ordinals in which for every λ A (...) λ = {α ∣Φ(λ, a)}. (shrink)

We give a direct mathematical proof of the Mathias-Silver theorem that every analytic set is Ramsey.

We study ultrafilters produced by forcing, obtaining different combinatorics and related Rudin-Keisler ordering; in particular we answer a question of Baumgartner and Taylor regarding tensor products of ultrafilters. Adapting a method of Blass and Mathias, we show that in most cases the combinatorics satisfied by the ultrafilters recapture the forcing notion in the Lévy model.