scientific article; zbMATH DE number 5521857
From MaRDI portal
Publication:3607635
Recommendations
- Coding in the partial order of enumerable sets
- On coding uncountable sets by reals
- Equivalence of codes for countable sets of reals
- A coding of the countable linear orderings
- Topological partition relations for countable ordinals
- An effective minimal encoding of uncountable sets
- UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS
- Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees
- Codings and strongly inaccessible cardinals
- Ordinal sums of representable uninorms
Cited in
(13)- Determinacy implies that \(\aleph_ 2\) is supercompact
- Representing pointsets as unions of Borel sets
- An introduction to combinatorics of determinacy
- Representing Projective Sets as Unions of Borel Sets
- The calculus of partition sequences, changing cofinalities, and a question of Woodin
- Cofinality and measurability of the first three uncountable cardinals
- Definable combinatorics at the first uncountable cardinal
- The size of the class of countable sequences of ordinals
- Finer topologies on pointsets in Polish spaces
- COUNTABLE LENGTH EVERYWHERE CLUB UNIFORMIZATION
- Almost Everywhere Behavior of Functions According to Partition Measures
- The axiom of real determinacy and the axiom of real Blackwell determinacy
- Partition properties and well-ordered sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3607635)