- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Iterated perfect-set forcing
Annals of Mathematical Logic 17 (3):271-288 (1979)
Add citations
You must login to add citations.
|
|
|
|
|
|
|
|
|
We give an affirmative answer to Brendle's and Hrušák's question of whether the club principle together with h > N₁ is consistent. We work with a class of axiom A forcings with countable conditions such that q ≥ n p is determined by finitely many elements in the conditions p and q and that all strengthenings of a condition are subsets, and replace many names by actual sets. There are two types of technique: one for tree-like forcings and one for (...) |
|
|
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. |
|
|
A family \ is called Rosenthal if for every Boolean algebra \, bounded sequence \ of measures on \, antichain \ in \, and \, there exists \ such that \<\varepsilon \) for every \. Well-known and important Rosenthal’s lemma states that \ is a Rosenthal family. In this paper we provide a necessary condition in terms of antichains in \}\) for a family to be Rosenthal which leads us to a conclusion that no Rosenthal family has cardinality strictly less (...) |
|
|
We consider maximal almost disjoint families of block subspaces of countable vector spaces, focusing on questions of their size and definability. We prove that the minimum infinite cardinality of such a family cannot be decided in ZFC and that the “spectrum” of cardinalities of mad families of subspaces can be made arbitrarily large, in analogy to results for mad families on ω. We apply the author’s local Ramsey theory for vector spaces [32] to give partial results concerning their definability. |
|
|
We prove that the Sacks forcing collapses the continuum onto ${\frak d}$ , answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses $\omega_2$ then it forces $\diamondsuit_{\omega_{1}}$. |
|
|
We improve results of Marczewski, Frankiewicz, Brown, and others comparing the $\sigma$-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 $\sigma$-ideals to include the completely Ramsey (...) |
|
|
In this paper we show that it is consistent with ZFC that for any set of reals of cardinality the continuum, there is a continuous map from that set onto the closed unit interval. In fact, this holds in the iterated perfect set model. We also show that in this model every set of reals which is always of first category has cardinality less than or equal to ω 1. |
|
|
It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a supercompact cardinal that there is a uniform ultrafilter on \ which is generated by fewer than \ sets. |
|
|
|
|
|
We study cardinal invariants of systems of meager hereditary families of subsets of ω connected with the collapse of the continuum by Sacks forcing S and we obtain a cardinal invariant yω such that S collapses the continuum to yω and y ≤ yω ≤ b. Applying the Baumgartner-Dordal theorem on preservation of eventually narrow sequences we obtain the consistency of y = yω < b. We define two relations $\leq _{0}^{\ast}$ and $\leq _{1}^{\ast}$ on the set $(^{\omega}\omega)_{{\rm Fin}}$ of (...) |
|
|
For a Polish group let be the minimal number of translates of a fixed closed nowhere dense subset of required to cover . For many locally compact this cardinal is known to be consistently larger than which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups . For example the equality holds for the group of permutations of the integers, the additive group of a separable Banach (...) |
|
|
|
|
|
We show that it is independent whether club $\kappa $ -Miller forcing preserves $\kappa ^{++}$. We show that under $\kappa ^{ \kappa $, club $\kappa $ -Miller forcing collapses $\kappa ^{<\kappa }$ to $\kappa $. Answering a question by Brendle, Brooke-Taylor, Friedman and Montoya, we show that the iteration of ultrafilter $\kappa $ -Miller forcing does not have the Laver property. |
|
|
We specialise Aronszajn trees by an $\omega ^\omega $ -bounding forcing that adds reals. We work with creature forcings on uncountable spaces. As an application of these notions of forcing, we answer a question of Moore, Hrušák and Džamonja whether ◇(b) implies the existence of a Souslin tree in a negative way by showing that "◇∂ and every Aronszajn tree is special" is consistent relative to ZFC. |
|
|
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 investigate the mathematics of a model of the human mind which has been proposed by the psychologist Jens Mammen. Mathematical realizations of this model consists of what the first author (A.T.) has called Mammen spaces, where a Mammen space is a triple in the Baumgartner–Laver model.Finally, consequences for psychology are discussed. |
|
|
James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...) |
|
|
|
|
|
Let κ be a regular cardinal and P a partial ordering preserving the regularity of κ. If P is (κ-Baire and) of density κ, then there is a mad family on κ killed in all generic extensions (if and) only if below each p∈P there exists a κ-sized antichain. In this case a mad family on κ is killed (if and) only if there exists an injection from κ onto a dense subset of Ult(P) mapping the elements of onto nowhere (...) |
|
|
If κω is a cardinal, a complete Boolean algebra is called κ-dependent if for each sequence bβ: β<κ of elements of there exists a partition of the unity, P, such that each pP extends bβ or bβ′, for κ-many βκ. The connection of this property with cardinal functions, distributivity laws, forcing and collapsing of cardinals is considered. |
|
|
|
|
|
The parameter-free part $$\textbf{PA}_2^*$$ of $$\textbf{PA}_2$$, second order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an $$\omega $$ -model of $$\textbf{PA}_2^*+ \textbf{CA}(\Sigma ^1_2)$$, in which an example of the full Comprehension schema $$\textbf{CA}$$ fails. Using Cohen’s forcing, we also define an $$\omega $$ -model of $$\textbf{PA}_2^*$$, in which not every set has its complement, and hence the full $$\textbf{CA}$$ fails in a rather elementary way. |
|
|
We prove that if I is a partially ordered set in a countable transitive model M of ZFC then M can be extended by a generic sequence of reals a i , i ∈ I, such that ℵ M 1 is preserved and every a i is Sacks generic over $\mathfrak{M}[\langle \mathbf{a}_j: j . The structure of the degrees of M-constructibility of reals in the extension is investigated. As applications of the methods involved, we define a cardinal invariant to distinguish (...) |
|
|
In this commemorative article, the work of Richard Laver is surveyed in its full range and extent. |
|
|
We propose a canonization scheme for smooth equivalence relations on Rω modulo restriction to E0-large infinite products. It shows that, given a pair of Borel smooth equivalence relations E, F on Rω, there is an infinite E0-large perfect product P⊆Rω such that either F⊆E on P, or, for some ℓ<ω, the following is true for all x,y∈P: xEy implies x(ℓ)=y(ℓ), and x↾(ω∖{ℓ})=y↾(ω∖{ℓ}) implies xFy. |
|
|
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. |
|
|
In this paper we show that it is consistent with ZFC that the cardinality of every maximal cofinitary group of Sym(ω) is strictly greater than the cardinal numbers o and a. |
|
|
|
|
|
Using side-by-side Sacks forcing, it is shown that it is consistent that 2 ω be large and that there be many types of ultrafilters of character ω 1. |
|
|
|
|
|
By an "inverse iteration" of Sacks forcing over a model of V = L, we produce a model in which the degrees of constructibility of nonconstructible reals have order type ω 1 *. |
|
|
We show that Miller partition forcing preserves selective independent families and P-points, which implies the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {u}=\mathfrak {i}<\mathfrak {a}_T=\omega _2$. In addition, we show that Shelah’s poset for destroying the maximality of a given maximal ideal preserves tight mad families and so we establish the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {i}=\omega _1<\mathfrak {u}=\mathfrak {a}_T=\omega _2$. |
|
|
We develop the theory of layered posets and use the notion of layering to prove a new iteration theorem is κ-cc, as long as direct limits are used sufficiently often. This iteration theorem simplifies and generalizes the various chain condition arguments for universal Kunen iterations in the literature on saturated ideals, especially in situations where finite support iterations are not possible. We also provide two applications:1 For any n≥1, a wide variety of <ωn−1-closed, ωn+1-cc posets of size ωn+1 can consistently (...) |
|
|
If [Formula: see text] is regular and [Formula: see text], then the existence of a weakly presaturated ideal on [Formula: see text] implies [Formula: see text]. This partially answers a question of Foreman and Magidor about the approachability ideal on [Formula: see text]. As a corollary, we show that if there is a presaturated ideal [Formula: see text] on [Formula: see text] such that [Formula: see text] is semiproper, then CH holds. We also show some barriers to getting the tree (...) |
|
|
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 (...) |
|
|
We will prove that there exists a model of ZFC+"c = ω 2 " in which every $M \subseteq \mathbb{R}$ of cardinality less than continuum c is meager, and such that for every $X \subseteq \mathbb{R}$ of cardinality c there exists a continuous function f: R → R with f[X] = [0, 1]. In particular in this model there is no magic set, i.e., a set $M \subseteq \mathbb{R}$ such that the equation f[M] = g[M] implies f = g for (...) |
|
|
|
|
|
|
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6f97f49787-hdzht uwo