Axiomatizations and conservation results for fragments of bounded arithmetic

Author(s):  
Samuel R. Buss
Keyword(s):  
2010 ◽  
Vol 56 (2) ◽  
pp. 126-130
Author(s):  
Zofia Adamowicz ◽  
Leszek Aleksander Kołodziejczyk
Keyword(s):  

2014 ◽  
Vol 79 (2) ◽  
pp. 496-525 ◽  
Author(s):  
SAMUEL R. BUSS ◽  
LESZEK ALEKSANDER KOŁODZIEJCZYK ◽  
NEIL THAPEN

AbstractWe study the long-standing open problem of giving $\forall {\rm{\Sigma }}_1^b$ separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the $\forall {\rm{\Sigma }}_1^b$ Herbrandized ordering principle is unprovable in a fragment of bounded arithmetic that includes the injective weak pigeonhole principle for polynomial time functions, and also in a fragment that includes the surjective weak pigeonhole principle for FPNP functions. We further give new propositional translations, in terms of random resolution refutations, for the consequences of $T_2^1$ augmented with the surjective weak pigeonhole principle for polynomial time functions.


2006 ◽  
Vol 192 (1) ◽  
pp. 37-65 ◽  
Author(s):  
Ali Enayat
Keyword(s):  

Author(s):  
Constantinos Bartzis ◽  
Tevfik Bultan
Keyword(s):  

Author(s):  
Gaisi Takeuti ◽  
Masahiro Yasumoto
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document