Annals of Pure and Applied Logic 103 (1-3):155-199 (2000)

In this paper we introduce a system AID of bounded arithmetic. The main feature of AID is to allow a form of inductive definitions, which was extracted from Buss’ propositional consistency proof of Frege systems F in Buss 3–29). We show that AID proves the soundness of F , and conversely any Σ 0 b -theorem in AID yields boolean sentences of which F has polysize proofs. Further we define Σ 1 b -faithful interpretations between AID+Σ 0 b -CA and a quantified theory QALV of an equational system ALV in Clote 57–106). Hence ALV also proves the soundness of F
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/s0168-0072(99)00041-x
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 61,025
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Bounded Arithmetic for NC, ALogTIME, L and NL.P. Clote & G. Takeuti - 1992 - Annals of Pure and Applied Logic 56 (1-3):73-117.
Propositional Consistency Proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.

Add more references

Citations of this work BETA

On Theories of Bounded Arithmetic for NC 1.Emil Jeřábek - 2011 - Annals of Pure and Applied Logic 162 (4):322-340.
The Equivalence of Theories That Characterize ALogTime.Phuong Nguyen - 2009 - Archive for Mathematical Logic 48 (6):523-549.
Expander Construction in VNC1.Sam Buss, Valentine Kabanets, Antonina Kolokolova & Michal Koucký - 2020 - Annals of Pure and Applied Logic 171 (7):102796.

Add more citations

Similar books and articles

Notes on Polynomially Bounded Arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Tautologies From Pseudo-Random Generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.
Approximate Counting by Hashing in Bounded Arithmetic.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (3):829-860.
On Interpretations of Bounded Arithmetic and Bounded Set Theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
Strict $${\Pi^1_1}$$ -Reflection in Bounded Arithmetic.António M. Fernandes - 2010 - Archive for Mathematical Logic 49 (1):17-34.


Added to PP index

Total views
21 ( #505,563 of 2,439,477 )

Recent downloads (6 months)
1 ( #433,110 of 2,439,477 )

How can I increase my downloads?


My notes