Affiliation:
1. IBM Research, San Jose, CA
2. Univ. of Michigan, Ann Arbor
Abstract
In connection with the least fixed point operator the following question was raised: Suppose that a first-order formula
P
(
P
) is (semantically) monotone in a predicate symbol
P
on finite structures. Is
P
(
P
) necessarily equivalent on finite structures to a first-order formula with only positive occurrences of
P
? In this paper, this question is answered negatively. Moreover, the counterexample naturally gives a uniform sequence of constant-depth, polynomial-size, monotone Boolean circuits that is not equivalent to any (however nonuniform) sequence of constant-depth, polynomial-size, positive Boolean circuits.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference12 articles.
1. ~-formulae on finite structures;AJTA;Ann. Pure Appl. Logic,1983
2. Structure and complexity of relational queries;CHANDRA A. K.;J. Comput. Syst. Sci.,1980
3. and the polynomial time hierarchy;FURST M.;Math. Syst. Theory,1984
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The umbilical cord of finite model theory;Journal of Logic and Computation;2023-09-01
2. Positive First-order Logic on Words and Graphs;Logical Methods in Computer Science;2023-07-25
3. Proof Complexity of Monotone Branching Programs;Revolutions and Revelations in Computability;2022
4. A polynomial excluded-minor approximation of treedepth;Journal of the European Mathematical Society;2021-10-25
5. Positive First-order Logic on Words;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29