Forcing on bounded arithmetic II

DOI10.2307/2586716zbMath0920.03061OpenAlexW2022376106MaRDI QIDQ4227870

Masahiro Yasumoto, Gaisi Takeuti

Publication date: 31 August 1999

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586716

zbMATH Keywords

forcingbounded arithmeticP=NPBoolean valued modelsNP=co-NP

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Models of arithmetic and set theory (03C62) Second- and higher-order arithmetic and fragments (03F35) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (3)

Partially definable forcing and bounded arithmetic ⋮ Forcing in Proof Theory ⋮ On the correspondence between arithmetic theories and propositional proof systems – a survey

This page was built for publication: Forcing on bounded arithmetic II