Copyright © 2000 Elsevier Science B.V. All rights reserved.
Programs over semigroups of dot-depth one
Available online 15 August 2000.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The notion of a p-variety arises in the algebraic approach to Boolean circuit complexity. It has great significance, since many known and conjectured lower bounds on circuits are equivalent to the assertion that certain classes of semigroups form p-varieties. In this paper, we prove that semigroups of dot-depth one form a p-variety. This example has the following implication: if a Boolean combination of Σ1 formulas, using arbitrary numerical predicates, defines a regular language, one can then find an equivalent Σ1 formula all of whose numerical predicates are regular.
Author Keywords: Semigroup; Dot-depth one; p-variety; Boolean circuits; Σ1 formula







E-mail Article
Add to my Quick Links

Cited By in Scopus (6)

(“during”) is not expressible in first-order logics of programs based on the operator
(“after”), but it is expressible with the help of array assignments or rich tests. From this we deduce that array assignments add to the power of logics based on nondeterministic effective tree-schemes and that rich tests add to the power of logics based on flowcharts. The proof of the main theorem is based on a result of Furst, Saxe, and Sipser (




