scientific article; zbMATH DE number 5521857

MaRDI QIDQ3607635zbMATH OpenFDO

Authors Alexander S. Kechris, W. Hugh Woodin

Publication date 2 March 2009

zbMATH Keywords

Baire categoryordinal gamespartition propertyprojective ordinalsgeneric codesgeneric elementary embeddingsreliable ordinals

Mathematics Subject Classification ID

Games involving topology, set theory, or logic (91A44) Other combinatorial set theory (03E05) Descriptive set theory (03E15) Ordinal and cardinal numbers (03E10) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60)

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 \(\omega \)-enumeration degrees
• Codings and strongly inaccessible cardinals
• Ordinal sums of representable uninorms

Cited in

(12)

• Almost Everywhere Behavior of Functions According to Partition Measures
• Representing pointsets as unions of Borel sets
• Cofinality and measurability of the first three uncountable cardinals
• Representing Projective Sets as Unions of Borel Sets
• The size of the class of countable sequences of ordinals
• Definable combinatorics at the first uncountable cardinal
• The calculus of partition sequences, changing cofinalities, and a question of Woodin
• Partition properties and well-ordered sequences
• An introduction to combinatorics of determinacy
• Determinacy implies that \(\aleph_ 2\) is supercompact
• COUNTABLE LENGTH EVERYWHERE CLUB UNIFORMIZATION
• Finer topologies on pointsets in Polish spaces

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)