Forcing on bounded arithmetic II

DOI10.2307/2586716MaRDI QIDQ4227870zbMATH OpenOpenAlexFDO

Authors Gaisi Takeuti, Masahiro Yasumoto

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

Boolean valued modelsbounded arithmeticforcingNP=co-NPP=NP

Mathematics Subject Classification ID

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

Cited in

(7)

• Partially definable forcing and bounded arithmetic
• scientific article; zbMATH DE number 999649 (Why is no real title available?)
• On the correspondence between arithmetic theories and propositional proof systems – a survey
• scientific article; zbMATH DE number 1344922 (Why is no real title available?)
• Forcing in Proof Theory
• scientific article; zbMATH DE number 922619 (Why is no real title available?)
• Models of Bounded Arithmetic Theories and Some Related Complexity Questions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227870)