On a theorem of {G}alvin and {N}agy

DOI10.1007/S10474-017-0705-7MaRDI QIDQ1677593zbMATH OpenOpenAlexFDO

Authors Péter Komjáth

Publication date 10 November 2017

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10474-017-0705-7

zbMATH Keywords

arithmetic progressioncombinatorial gameuncountable vector space

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Games involving topology, set theory, or logic (91A44) Combinatorial games (91A46)

Review text

The author gives the proof of a problem of P. Erdős and A. Hajnal concerning the existence of winning strategies in a combinatorial game of a transfinite length. Such a proof was announced earlier by F. Galvin and Z. Nagy but never published.

Recommendations

• A note on a theorem by Aldo Ghizzetti
• On a generalization of Albert's theorem
• On a theorem of Ganley
• On a theorem of Gagola and Lewis
• On a Theorem of Gundersen and Laine.
• scientific article; zbMATH DE number 19172
• scientific article; zbMATH DE number 3867681
• scientific article; zbMATH DE number 62427
• scientific article; zbMATH DE number 4181955
• scientific article; zbMATH DE number 3184254

Cites work

• scientific article; zbMATH DE number 970821 (Why is no real title available?)
• Variations on a game

Cited in

(1)

• Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle

This page was built for publication: On a theorem of {G}alvin and {N}agy

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