Lifting independence results in bounded arithmetic

DOI10.1007/s001530050118zbMath0924.03107OpenAlexW2036503832MaRDI QIDQ1283131

Mario Chiari, Jan Krajíček

Publication date: 15 November 1999

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050118

zbMATH Keywords

Ramsey's theoremlifting methodbounded arithmetic lifting method

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

FRAGMENTS OF APPROXIMATE COUNTING ⋮ A note on propositional proof complexity of some Ramsey-type statements ⋮ Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem ⋮ Upper and lower Ramsey bounds in bounded arithmetic ⋮ Induction rules in bounded arithmetic