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

DOI10.1215/00294527-1960488zbMath1280.03015OpenAlexW2021977968MaRDI QIDQ1949169

Noam Greenberg, Chris J. Conidis, Daniel D. Turetsky

Publication date: 25 April 2013

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1361454976

zbMATH Keywords

ATRreverse mathematicsexcluded middlehyperarithmetic comprehensioninfinitary propositional calculusopen determinacyracing pawns

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The limits of determinacy in second-order arithmetic
• Galvin’s “racing pawns” game and a well-ordering of trees
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS

This page was built for publication: Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle