Coherent spaces constructively
Among cocomplete categories, the locally presentable ones can be defined as those with a strong generator consisting of presentable objects. Assuming Vopěnka’s Principle, we prove that a cocomplete category is locally presentable if and only if it has a colimit dense subcategory and a generator consisting of presentable objects. We further show that a -element set is colimit-dense in , and spaces of countable dimension are colimit-dense in .
A structure where each is an equivalence relation on A is called an n-grid if any two equivalence classes coming from distinct ’s intersect in a finite set. A function χ: A → n is an acceptable coloring if for all i ∈ n, the intersects each -equivalence class in a finite set. If B is a set, then the n-cube Bⁿ may be seen as an n-grid, where the equivalence classes of are the lines parallel to the ith coordinate axis. We use elementary submodels of the universe to characterize those n-grids...
We study combinatorial principles we call the Homogeneity Principle HP(κ) and the Injectivity Principle IP(κ,λ) for regular κ > ℵ₁ and λ ≤ κ which are formulated in terms of coloring the ordinals < κ by reals. These principles are strengthenings of and of I. Juhász, L. Soukup and Z. Szentmiklóssy. Generalizing their results, we show e.g. that IP(ℵ₂,ℵ₁) (hence also IP(ℵ₂,ℵ₂) as well as HP(ℵ₂)) holds in a generic extension of a model of CH by Cohen forcing, and IP(ℵ₂,ℵ₂) (hence also HP(ℵ₂))...
Let be the set of subsets of of cardinality . Let be a coloring of and a coloring of . We write if every -homogeneous is also -homogeneous. The least such that for some is called the -width of and denoted by . In the first part of the paper we prove the existence of colorings with high -width. In particular, we show that for each and there is a coloring with . In the second part of the paper we give applications of wide colorings in the theory of generalized quantifiers....
We study combinatorial properties of the partial order (Dense(ℚ),⊆). To do that we introduce cardinal invariants , , , , , describing properties of Dense(ℚ). These invariants satisfy ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚℚ = pℚ = tℚ = iℚ > hℚ > rnon(M)=min||: ⊆ Dense(R) ∧ (∀I ∈ nwd(R))(∃D ∈ )(I ∩ D = ∅) and cof(M) = min||: ⊆ Dense(ℚ) ∧ (∀I ∈ nwd)(∃D ∈ )(I ∩ = ∅). We use these facts to show that cof(M) ≤ i, which improves a result of S. Shelah.
This note is devoted to combinatorial properties of ideals on the set of natural numbers. By a result of Mathias, two such properties, selectivity and density, in the case of definable ideals, exclude each other. The purpose of this note is to measure the ``distance'' between them with the help of ultrafilter topologies of Louveau.
Some of the covering properties of spaces as defined in Parts I and II are here characterized by games. These results, applied to function spaces of countable tightness, give new characterizations of countable fan tightness and countable strong fan tightness. In particular, each of these properties is characterized by a Ramseyan theorem.
We use Ramseyan partition relations to characterize: ∙ the classical covering property of Hurewicz; ∙ the covering property of Gerlits and Nagy; ∙ the combinatorial cardinal numbers and add(ℳ ). Let X be a -space. In [9] we showed that has countable strong fan tightness as well as the Reznichenko property if, and only if, all finite powers of X have the Gerlits-Nagy covering property. Now we show that the following are equivalent: 1. has countable fan tightness and the Reznichenko property. 2....