𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monotonicity and the Expressibility of NP Operators

✍ Scribed by Iain A. Stewart


Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
517 KB
Volume
40
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

We investigate why similar extensions of first‐order logic using operators (that is, generalized quantifiers) corresponding to NP‐complete decision problems apparently differ in expressibility: the logics capture either NP or L^NP^. It had been conjectured that the complexity class captured is NP if and only if the operator is monotone. We show that this conjecture is false. However, we provide evidence supporting a revised conjecture involving finite variations of monotone problems.

Mathematics Subject Classification: 68Q15, 03D15, 03C13.


πŸ“œ SIMILAR VOLUMES


On the Monotonicity of Positive Linear O
✍ M.Kazim Khan; B. Della Vecchia; A. Fassih πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 377 KB

We provide sufficient conditions for a sequence of positive linear approximation operators, L n ( f, x), converging to f (x) from above to imply the convexity of f. We show that, for the convolution operators of Feller type, K n ( f, x), generated by a sequence of iid random variables taking values

The Range of a Monotone Operator
✍ S. Simons πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 265 KB