Partitioning pairs of countable ordinals
From MaRDI portal
Publication:1111550
DOI10.1007/BF02392561zbMath0658.03028MaRDI QIDQ1111550
Publication date: 1987
Published in: Acta Mathematica (Search for Journal in Brave)
Related Items
A Subcategory of Top, Reflection and Weakly Collectionwise Hausdorff Spaces, Parametrized $\diamondsuit $ principles, A Banach Space on which there are Few Operators, Ultrafilters generated by a closed set of functions, Wild edge colourings of graphs, A solution to the L space problem, SET MAPPING REFLECTION, A consistency result on thin-very tall Boolean algebras, Bounded forcing axioms and the continuum, Partitioning pairs of countable sets of ordinals, A class of Banach spaces with few non-strictly singular operators, Shelah's pcf theory and its applications, Cardinal invariants of infinite groups, \(\omega {}^*_ 2U(\omega_ 2)\) can be \(C^*\)-embedded in \(\beta \omega_ 2\), Notes on singular cardinal combinatorics, Cardinal invariants of the continuum and combinatorics on uncountable cardinals, Random trees under CH, Some higher-gap examples in combinatorial set theory, Partitioning pairs of countable ordinals, Strong negative partition relations below the continuum, Forcing axioms and stationary sets, EM constructions for a class of generalized quantifiers, Canonical models for \(\aleph_1\)-combinatorics, Some partitions of three-dimensional combinatorial cubes, Fragments of Martin's axiom and \(\Delta_ 3^ 1\) sets of reals, A class of Banach spaces with no unconditional basic sequence, Local coherence., On strong chains of uncountable functions, Generating the club filter on \({\mathcal P}_{\kappa}\lambda\), Summable gaps, Sequential fans in topology, Morasses, square and forcing axioms, \(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders, The proper forcing axiom, Prikry forcing, and the singular cardinals hypothesis, Products of regular cardinals and cardinal invariants of products of Boolean algebras, Regressive Partition Relations for Infinite Cardinals, Weakly Compact Cardinals and Nonspecial Aronszajn Trees, Proper Forcing, Cardinal Arithmetic, and Uncountable Linear Orders, NO BOUND FOR THE FIRST FIXED POINT, Strong negative partition above the continuum, Unnamed Item, Independence and consistency proofs in quadratic form theory, On the existence of strong chains in ℘(ω1)/Fin
Cites Work
- Unnamed Item
- Unnamed Item
- Aronszajn trees and partitions
- Can you take Solovay's inaccessible away?
- Partition relations for partially ordered sets
- A graph which embeds all small graphs on any large set of vertices
- Some higher-gap examples in combinatorial set theory
- Was Sierpinski right? I
- Partitioning pairs of countable ordinals
- Extraspecial p-groups
- Decomposing uncountable squares to countably many chains
- Some counterexamples in the partition calculus
- Regressive Partition Relations for Infinite Cardinals
- Strong negative partition above the continuum
- Infinite games and reduced products
- Weak Partition Relations
- On the complete subgraphs of graphs defined by systems of sets
- The fine structure of the constructible hierarchy
