A choice function on countable sets, from determinacy

DOI10.1090/S0002-9939-2014-12349-5MaRDI QIDQ5179344zbMATH OpenFDO

Authors Paul Larson

Publication date 19 March 2015

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9939-2014-12349-5

zbMATH Keywords

axiom of real determinacychoice function on countable sets

Mathematics Subject Classification ID

Axiom of choice and related propositions (03E25) Other aspects of forcing and Boolean-valued models (03E40) Determinacy principles (03E60)

Recommendations

• A countable definable set containing no definable elements
• The equivalence of partition properties and determinacy
• Projective games on the reals
• The Axiom of Choice, the Löwenheim-Skolem Theorem and Borel models
• Games of length 2
• scientific article; zbMATH DE number 4066872
• Bounds on the strength of ordinal definable determinacy in small admissible sets
• Determinacy and large cardinals
• scientific article; zbMATH DE number 4142027
• Model theory under the axiom of determinateness

Cites work

• A trichotomy theorem in natural models of \(\text{AD}^+\)
• Determinateness and Partitions
• Happy families
• Ramsey theorems for product of finite sets with submeasures
• Real games and strategically selective coideals
• Souslin partitions of products of finite sets

Cited in

(6)

• A trichotomy theorem in natural models of \(\text{AD}^+\)
• Ramsey ultrafilters and countable-to-one uniformization
• THE SELECTOR PRINCIPLE FOR ANALYTIC EQUIVALENCE RELATIONS DOES NOT IMPLY THE EXISTENCE OF AN A₂ WELL ORDERING OF THE CONTINUUM
• Partial choice functions for families of finite sets
• Canonical models for fragments of the axiom of choice
• Real games and strategically selective coideals

This page was built for publication: A choice function on countable sets, from determinacy

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