Fragments of bounded arithmetic and bounded query classes
نویسندگان
چکیده
منابع مشابه
Fragments of Bounded Arithmetic and Bounded Query Classes Jan
We characterize functions and predicates Z^+, -definable in S!¡ ■ In particular, predicates I^+1-definable in S^ are precisely those in bounded query Y? YP class .Pi[0(logn)] (which equals to Log Space • by [B-H,W]). This implies yP that Sj ^ T-\ unless P •[0(lo$n)] = Apj+X . Further we construct oracle A such that for all i > 1 : P^iA)lO(logn)] ¿ tf¡+x(A). It follows that S fa) ¿ Tfa) for all ...
متن کاملBounded query classes and the difference hierarchy
Let A be any nonrecursive set. We deene a hierarchy of sets (and a corresponding hierarchy of degrees) that are reducible to A based on bounding the number of queries to A that an oracle machine can make. When A is the halting problem K our hierarchy of sets interleaves with the diierence hierarchy 1 on the r.e. sets in a logarithmic way; this follows from a tradeoo between the number of parall...
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملQuantified propositional calculi and fragments of bounded arithmetic
The motivation for this paper comes from a well-known and probably very difficult problem whether Bounded Arithmetic is fiIiitely axiomatizable. Attempts tosolve this problem using the machinery of mathematicallogic have failed so far. It is possible that, the problem can be solved by combining logic with combinatl;>rics. This would require a transformation onto a more combinatorial problem. Th...
متن کاملAxiomatizations and Conservation Results for Fragments of Bounded Arithmetic
This paper presents new results on axiomatizations for fragments of Bounded Arithmetic which improve upon the author’s dissertation. It is shown that (Σi+1 ∩Π b i+1)-PIND and strong Σ b i -replacement are consequences of S 2 . Also ∆ b i+1 -IND is a consequence of T i 2 . The latter result is proved by showing that S 2 is ∀∃Σ b i+1 -conservative over T i 2 . Furthermore, S i+1 2 is conservative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1993
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-1993-1124169-x