Sureson, C., Symmetric submodels of a Cohen generic extension, Annals of Pure and Applied Logic 58 247–261. We study some symmetric submodels of a Cohen generic extension and the satisfaction of several properties ) which strongly violate the axiom of choice.

We continue [21] and study partition numbers of partial orderings which are related to /fin. In particular, we investigate Pf, be the suborder of /fin)ω containing only filtered elements, the Mathias partial order M, and , ω the lattice of partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for Pf. We show that the partition number of is C. We also show that consistently the distributivity number of ω is smaller than (...) the distributivity number of /fin. We also investigate partitions of a Polish space into closed sets. We show that such a partition either is countable or has size at least D, where D is the dominating number. We also show that the existence of a dominating family of size 1 does not imply that a Polish space can be partitioned into 1 many closed sets. (shrink)

We prove that consistently the Lebesgue null ideal is not Tukey reducible to the Silver null ideal. This contrasts with the situation for the meager ideal which, by a recent result of the author, Spinas [Silver trees and Cohen reals, Israel J. Math. 211 473–480] is Tukey reducible to the Silver ideal.

Let ${{\mathcal J}\,(\mathbb M^2)}$ denote the σ-ideal associated with two-dimensional Miller forcing. We show that it is relatively consistent with ZFC that the additivity of ${{\mathcal J}\,(\mathbb M^2)}$ is bigger than the covering number of the ideal of the meager subsets of ω ω. We also show that Martin’s Axiom implies that the additivity of ${{\mathcal J}\,(\mathbb M^2)}$ is 2 ω .Finally we prove that there are no analytic infinite maximal antichains in any finite product of ${\mathfrak{P}{(\omega)}/{\rm fin}}$.

We generalize the ultrapower in a way suitable for choiceless set theory. Given an ultrafilter, forcing is used to construct an extended ultrapower of the universe, designed so that the fundamental theorem of ultrapowers holds even in the absence of the axiom of choice. If, in addition, we assume DC, then an extended ultrapower of the universe by a countably complete ultrafilter must be well-founded. As an application, we prove the Vopěnka-Hrbáček theorem from ZF + DC only (the proof of (...) Vopěnka and Hrbáček used the full axiom of choice): if there exists a strongly compact cardinal, then the universe is not constructible from a set. The same method shows that, in L[ 2 ω ], there cannot exist a θ-compact cardinal less than θ (where θ is the least cardinal onto which the continuum cannot be mapped); a similar result can be proven for other models of the form L[ A ]. The result for L[ 2 ω ] is of particular interest in connection with the axiom of determinacy. The extended ultrapower construction of this paper is an improved version of the author's earlier pseudo-ultrapower method, making use of forcing rather than the omitting types theorem. (shrink)

Mitchell, W.J., An infinitary Ramsey property, Annals of Pure and Applied Logic 57 151–160. We prove that the consistency of a measurable cardinal implies the consistency of a cardinal κ>+ satisfying the partition relations κ ω and κ ωregressive. This result follows work of Spector which uses the same hypothesis to prove the consistency of ω1 ω. We also give some examples of partition relations which can be proved for ω1 using the methods of Spector but cannot be proved for (...) cardinals κ>+ without a much stronger hypothesis. (shrink)

In this paper we ask the question: to what extent do basic set theoretic properties of Loeb measure depend on the nonstandard universe and on properties of the model of set theory in which it lies? We show that, assuming Martin's axiom and κ-saturation, the smallest cover by Loeb measure zero sets must have cardinality less than κ. In contrast to this we show that the additivity of Loeb measure cannot be greater than ω 1 . Define $\operatorname{cof}(H)$ as the (...) smallest cardinality of a family of Loeb measure zero sets which cover every other Loeb measure zero set. We show that $\operatorname{card}(\lfloor\log_2(H)\rfloor) \leq \operatorname{cof}(H) \leq \operatorname{card}(2^H)$ , where card is the external cardinality. We answer a question of Paris and Mills concerning cuts in nonstandard models of number theory. We also present a pair of nonstandard universes $M \preccurlyeq N$ and hyperfinite integer H ∈ M such that H is not enlarged by N, 2 H contains new elements, but every new subset of H has Loeb measure zero. We show that it is consistent that there exists a Sierpiński set in the reals but no Loeb-Sierpiński set in any nonstandard universe. We also show that it is consistent with the failure of the continuum hypothesis that Loeb-Sierpiński sets can exist in some nonstandard universes and even in an ultrapower of a standard universe. (shrink)

We use games of Kastanas to obtain a new characterization of the classC ℱ of all sets that are completely Ramsey with respect to a given happy family ℱ. We then combine this with ideas of Plewik to give a uniform proof of various results of Ellentuck, Louveau, Mathias and Milliken concerning the extent ofC ℱ. We also study some cardinals that can be associated with the ideal ℐℱ of nowhere ℱ-Ramsey sets.

We present a version for κ-distributive ideals over a regular infinite cardinal κ of some of the combinatorial results of Mathias on happy families. We also study an associated notion of forcing, which is a generalization of Mathias forcing and of Prikry forcing.

The existence of a transitive, complete, and weakly independent relation on the full set of gambles implies the existence of a non-Ramsey set. Therefore, each transitive and weakly independent relation on the set of gambles either is incomplete or does not have an explicit description. Whatever tools decision theory makes available, there will always be decision problems where these tools fail us. In this sense, decision theory remains incomplete.

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.

If F ⊆ NN is an analytic family of pairwise eventually different functions then the following strong maximality condition fails: For any countable H ⊆ NN. no member of which is covered by finitely many functions from F, there is f ∈ F such that for all h ∈ H there are infinitely many integers k such that f(k) = h(k). However if V = L then there exists a coanalytic family of pairwise eventually different functions satisfying this strong maximality (...) condition. (shrink)

On the occasion of his 70th birthday, the work of Adrian Mathias in set theory is surveyed in its full range and extent.

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

In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.

We improve a theorem of Raisonnier by showing that Cons(ZFC+every Σ 2 1 -set of reals in Lebesgue measurable+every Π 2 1 -set of reals isK σ-regular) implies Cons(ZFC+there exists an inaccessible cardinal). We construct, fromL, a model where every Δ 3 1 -sets of reals is Lebesgue measurable, has the property of Baire, and every Σ 2 1 -set of reals isK σ-regular. We prove that if there exists a Σ n+1 1 unbounded filter on ω, then there exists (...) a nonK σ-regular Π 2 1 -subset. (shrink)

In this paper we will study four forcing notions, two of them giving a minimal degree of constructibility. These constructions give answers to questions in [Ih].

We prove that $\operatorname{cons}(ZF)$ implies $\operatorname{cons}(ZF +$ Borel conjecture + there exists a Ramsey ultrafilter). We also prove some results on strong measure zero sets from the existence of generalized Luzin sets. We study the relationships between strong measure zero sets and rapid filters on ω.

We study the intersection number of families of tall ideals. We show that the intersection number of the class of analytic P-ideals is equal to the bounding number ${\mathfrak{b}}$ , the intersection number of the class of all meager ideals is equal to ${\mathfrak{h}}$ and the intersection number of the class of all F σ ideals is between ${\mathfrak{h}}$ and ${\mathfrak{b}}$ , consistently different from both.

An ordering (≤K) on maximal almost disjoint (MAD) families closely related to destructibility of MAD families by forcing is introduced and studied. It is shown that the order has antichains of size.

We show that the non-existence of mad families is equiconsistent with \, answering an old question of Mathias. We also consider the above result in the general context of maximal independent sets in Borel graphs, and we construct a Borel graph G such that \ “there is no maximal independent set in G” is equiconsistent with \ “there exists an inaccessible cardinal”.

The paper "Partitions of Products" [DiPH] investigated the polarized partition relation $\begin{pmatrix}\omega\\\omega\\\omega\\\vdots\end{pmatrix} \rightarrow \begin{pmatrix}\alpha_1\\\alpha_1\\\alpha_2\\\vdots \end{pmatrix}$ The relation is consistent relative to an inaccessible cardinal if every α i is finite, but inconsistent if two are infinite. We show here that it consistent (relative to an inaccessible) for one to be infinite. Along the way, we prove an interesting proposition from ZFC concerning partitions of the finite subsets of ω.

We show that a theory of autonomous iterated Ramseyness based on second order arithmetic (SOA) is proof-theoretically equivalent to ${\Pi^1_2}$ -comprehension. The property of Ramsey is defined as follows. Let X be a set of real numbers, i.e. a set of infinite sets of natural numbers. We call a set H of natural numbers homogeneous for X if either all infinite subsets of H are in X or all infinite subsets of H are not in X. X has the property (...) of Ramsey if there exists a set which is homogeneous for X. The property of Ramsey is considered in reverse mathematics to compare the strength of subsystems of SOA. To characterize the system of ${\Pi^1_2}$ -comprehension in terms of Ramseyness we introduce a system of autonomous iterated Ramseyness, called R-calculus. We augment the language of SOA with additional set terms (called R-terms) ${R\vec{x}X\phi(\vec{x},X)}$ for each first order formula ${\phi(\vec{x},X)}$ (where φ may contain further R-terms). The R-calculus is a system which comprises comprehension for all first order formulas (which may contain R-terms or other set parameters) and defining axioms for the R-terms which claim that for each ${\vec{x}}$ , we can remove finitely many elements from the set ${R\vec{x}X\phi(\vec{x},X)}$ such that the remaining set is homogeneous for ${\{{X}{\phi(\vec{x},X)\}}}$ . We show that the R-calculus proves the same ${\Pi^1_1}$ -sentences as the system of ${\Pi^1_2}$ -comprehension. (shrink)

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.

We give proofs of Ramsey’s and Hindman’s theorems in which the corresponding homogeneous sets are found with a forcing argument. The object of this paper is the study of the partial order involved in the proof of Hindman’s theorem. We are going to denote it by PFIN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P}_{FIN}}$$\end{document}. As a main result, we prove that Mathias forcing does not add Matet reals, which implies that PFIN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} (...) \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P}_{FIN}}$$\end{document} is not equivalent to Mathias forcing. (shrink)

I use generic embeddings induced by generic normal measures on that can be forced to exist if κ is an indestructibly weakly compact cardinal. These embeddings can be applied in order to obtain the forcing axioms in forcing extensions. This has consequences in : The Singular Cardinal Hypothesis holds above κ, and κ has a useful Jónsson-like property. This in turn implies that the countable tower works much like it does when κ is a Woodin limit of Woodin cardinals. One (...) consequence is that every set of reals in the Chang model is Lebesgue measurable and has the Baire Property, the Perfect Set Property and the Ramsey Property. So indestructible weak compactness has effects on cardinal arithmetic high up and also on the structure of sets of real numbers, down low, similar to supercompactness. (shrink)

Using almost disjoint coding we prove the consistency of the existence of a definable ω-mad family of infinite subsets of ω together with.

We show that the existence of a ${\Pi^1_1}$ -definable mad family is consistent with the existence of a ${\Delta^{1}_{3}}$ -definable well-order of the reals and ${\mathfrak{b}=\mathfrak{c}=\aleph_3}$.

We study regularity properties related to Cohen, random, Laver, Miller and Sacks forcing, for sets of real numbers on the Δ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_3}$$\end{document} level of the projective hieararchy. For Δ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_2}$$\end{document} and Σ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_2}$$\end{document} sets, the relationships between these properties follows the pattern of the well-known Cichoń diagram for cardinal characteristics of the continuum. It is known that (...) assuming suitable large cardinals, the same relationships lift to higher projective levels, but the questions become more challenging without such assumptions. Consequently, all our results are proved on the basis of ZFC alone or ZFC with an inaccessible cardinal. We also prove partial results concerning Σ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_3}$$\end{document} and Δ41\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_4}$$\end{document} sets. (shrink)

We isolate several large classes of definable proper forcings and show how they include many partial orderings used in practice.

Given a topological Ramsey space math formula, we extend the notion of semiselective coideal to sets math formula and study conditions for math formula that will enable us to make the structure math formula a Ramsey space and also study forcing notions related to math formula which will satisfy abstract versions of interesting properties of the corresponding forcing notions in the realm of Ellentuck's space. This extends results from to the most general context of topological Ramsey spaces. As applications, we (...) prove that for every topological Ramsey space math formula, under suitable large cardinal hypotheses every semiselective ultrafilter math formula is generic over math formula; and that given a semiselective coideal math formula, every definable subset of math formula is math formula-Ramsey. This generalizes the corresponding results for the case when math formula is equal to Ellentuck's space. (shrink)

We improve results of Marczewski, Frankiewicz, Brown, and others comparing the σ-ideals of measure zero, meager, Marczewski measure zero, and completely Ramsey null sets; in particular, we remove CH from the hypothesis of many of Brown's constructions of sets lying in some of these ideals but not in others. We improve upon work of Marczewski by constructing, without CH, a nonmeasurable Marczewski measure zero set lacking the property of Baire. We extend our analysis of σ-ideals to include the completely Ramsey (...) null sets relative to a Ramsey ultrafilter and obtain all 32 possible examples of sets in some ideals and not others, some under the assumption of MA, but most in ZFC alone. We also improve upon the known constructions of a Marczewski measure zero set which is not Ramsey by using a set theoretic hypothesis which is weaker than those used by other authors. We give several consistency proofs: one concerning the relative sizes of the covering numbers for the meager sets and the completely Ramsey null sets; another concerning the size of non(CRU 0); and a third concerning the size of add(CRU 0). We also study those classes of perfect sets which are bases for the class of always first category sets. (shrink)

By B2 we denote the σ-ideal of all subsets A of the Cantor set {0,1}ω such that for every infinite subset T of ω the restriction A∣{0,1}T is a proper subset of {0,1}T. In this paper we investigate set theoretical properties of this and similar ideals.

We study the Mathias–Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias–Prikry forcings with summable ideals are all mutually bi-embeddable. We show that Mathias forcing associated with the complement of an analytic ideal always adds a dominating real. We also characterize filters for which the associated Mathias–Prikry forcing does not add eventually different reals, and show that they are countably generated provided they are Borel. We (...) give a characterization of ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\omega}$$\end{document}-hitting and ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\omega}$$\end{document}-splitting families which retain their property in the extension by a Laver type forcing associated with a coideal. (shrink)