The limits of determinacy in second order arithmetic: consistency and complexity strength

DOI10.1007/s11856-014-1117-9zbMath1371.03096OpenAlexW1979438158MaRDI QIDQ480816

Richard A. Shore, Antonio Montalbán

Publication date: 11 December 2014

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-014-1117-9

zbMATH Keywords

complexityconsistencyreverse mathematicsdeterminacysecond-order arithmetic

Mathematics Subject Classification ID

Games involving topology, set theory, or logic (91A44) Foundations of classical theories (including reverse mathematics) (03B30) Axiomatics of classical set theory and its fragments (03E30) Models of arithmetic and set theory (03C62) Second- and higher-order arithmetic and fragments (03F35) Determinacy principles (03E60)

Related Items (3)

Determinacy and monotone inductive definitions ⋮ Determinacy separations for class games ⋮ A Lipschitz determinacy principle equivalent to weak König lemma

Cites Work

• Unnamed Item
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• The limits of determinacy in second-order arithmetic
• Reverse Mathematics: The Playground of Logic
• The truth is never simple
• Jumping through the transfinite: the master code hierarchy of Turing degrees
• Higher set theory and mathematical practice

This page was built for publication: The limits of determinacy in second order arithmetic: consistency and complexity strength