Borel quasi-orderings in subsystems of second-order arithmetic

DOI10.1016/0168-0072(91)90050-VzbMath0746.03049MaRDI QIDQ1182484

Alberto Marcone

Publication date: 28 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

reflection principlessubsystems of second-order arithmeticATR\(_ 0\)Borel quasi-orderings of the realsGandy forcing

Mathematics Subject Classification ID

Descriptive set theory (03E15) Second- and higher-order arithmetic and fragments (03F35)

Related Items (2)

On the strength of König's duality theorem for countable bipartite graphs ⋮ Reverse mathematics and initial intervals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• Weak comparability of well orderings and reverse mathematics
• Addendum to ``Countable algebra and set existence axioms
• The metamathematics of scattered linear orderings
• The Galvin-Prikry theorem and set existence axioms
• Descriptive set theory
• Set theory. An introduction to independence proofs
• On the quasi-ordering of Borel linear orders under embeddability
• Borel Orderings
• Two results on borel orders

This page was built for publication: Borel quasi-orderings in subsystems of second-order arithmetic