Ergodic Undefinability in Set Theory and Recursion Theory

DOI10.2307/2044326MaRDI QIDQ3926571zbMATH OpenOpenAlexFDO

Authors Daniele Mundici

Publication date 1981

Full work available at URL https://doi.org/10.2307/2044326

zbMATH Keywords

Birkhoff theoremgenericityglobal choicerandom hyperarithmetic sequencerandomnessundefinability

Mathematics Subject Classification ID

Interpolation, preservation, definability (03C40) Hierarchies of computability and definability (03D55) Descriptive set theory (03E15) Axiom of choice and related propositions (03E25) Compact groups (22C05) Ergodic theory on groups (22D40) Measure-preserving transformations (28D05) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Cites work

• Comparison of the axioms of local and universal choice
• Ergodic theory on compact spaces
• Ergodic theory. Introductory lectures
• Global and local choice functions
• scientific article; zbMATH DE number 3627183 (Why is no real title available?)
• scientific article; zbMATH DE number 3450200 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• scientific article; zbMATH DE number 3302281 (Why is no real title available?)
• scientific article; zbMATH DE number 3322964 (Why is no real title available?)
• scientific article; zbMATH DE number 3337004 (Why is no real title available?)
• scientific article; zbMATH DE number 3035877 (Why is no real title available?)
• Measure and category in effective descriptive set theory
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory

This page was built for publication: Ergodic Undefinability in Set Theory and Recursion Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3926571)