Two distinct proofs of an exponential separation between regular resolution and unrestricted resolution are given. The previous best known separation between these systems was quasi-polynomial.
An exponential lower bound for the size of tree-like Cutting Planes refutations of a certain family of CN F formulas with polynomial size resolution refutations is proved. This implies an exponential separation between the tree-like versions and the dag-like versions of resolution and Cutting Planes. In both cases only superpolynomial separations were known… (More)
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2 Θ(n) in the worst case for infinite languages, and for finite languages it is n Ω(log log n) and n O(log n) , if the alphabet size grows with the number of states n of the given automaton. A new lower… (More)
We define theories of Bounded Arithmetic characterizing classes of functions computable by constant-depth threshold circuits of polynomial and quasipoly-nomial size. Then we define certain second-order theories and show that they characterize the functions in the Counting Hierarchy. Finally we show that the former theories are isomorphic to the latter via… (More)
A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactly characterize the parallel complexity class NC. This is achieved by use of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint.
In , we have proved an exponential lower bound of the form 2 Ω(n log n) on the size of ordered resolution refutations of a certain set of clauses. Here we show that this set of clauses has quasi-polynomial size tree-like resolution refutations, thus giving an exponential separation of ordered from tree-like resolution. In particular, since tree-like… (More)
A fragment of second-order lambda calculus (System <i>F</i>) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, that is, the types are assigned levels, and a quantified variable can only be instantiated by a type of smaller level, with a slightly liberalized treatment of… (More)
The systems K of transsnite cumulative types up to are extended to systems K 1 that include a natural innnitary inference rule, the so-called limit rule. For countable a semantic completeness theorem for K 1 is proved by the method of reduction trees, and it is shown that every model of K 1 is equivalent to a cumulative hierarchy of sets. This is used to… (More)
The theory b 1-CR of Bounded Arithmetic axiomatized by the b 1-bit-comprehension rule is defined and shown to be strongly related to the complexity class TC 0. The b 1-definable functions of b 1-CR are those in uniform TC 0 , and the b 2-definable functions are computable by counterexample computations using TC 0-functions. The latter is used to show that a… (More)
An exponential lower bound is proved for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential separation between tree-like and dag-like proofs for both Cutting Planes and resolution; in both cases only superpolynomial separations were known before 33, 22, 11]. In order to… (More)