Title of article :
Count(ifq) does not imply Count(ifp)
Original Research Article
Author/Authors :
S?ren Riis، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Abstract :
It is shown that the elementary principles Count(ifq) and Count(ifp) are logically independent in the system IΔ0(α) of Bounded Arithmetic. More specifically it is shown that Count(ifq) implies Count(ifp) exactly when each prime factor in p is a factor in q.
Keywords :
Bounded arithmetic , Independence , Forcing , Complexity
Journal title :
Annals of Pure and Applied Logic
Journal title :
Annals of Pure and Applied Logic
