The Complexity of Satisfaction Problems in Reverse Mathematics

DOI10.1007/978-3-319-08019-2_34zbMath1433.03018OpenAlexW1668012508MaRDI QIDQ5175906

Ludovic Patey

Publication date: 25 February 2015

Published in: Language, Life, Limits (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08019-2_34

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

This page was built for publication: The Complexity of Satisfaction Problems in Reverse Mathematics