Unary negation
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable.These logics generalize many interesting known formalisms, including modal logic and the $mu$-calculus, as well as conjunctive queries and SKIN HAIR monadic Datalog.We show that satisfiability an