Sciweavers

3 search results - page 1 / 1
» Separating Bounded Arithmetics by Herbrand Consistency
Sort
View
JSYML
2006
91views more  JSYML 2006»
13 years 5 months ago
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
Leszek Aleksander Kolodziejczyk
CSL
2007
Springer
13 years 11 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann