Why not negation by fixpoint?

This publication has 23 references indexed in Scilit:

• On the boolean closure of NP
  Published by Springer Nature ,2005
• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Fixed-point extensions of first-order logic
  Annals of Pure and Applied Logic, 1986
• Relational queries computable in polynomial time
  Information and Control, 1986
• Horn clause queries and generalizations
  The Journal of Logic Programming, 1985
• The complexity of facets (and some facets of complexity)
  Journal of Computer and System Sciences, 1984
• On the unique satisfiability problem
  Information and Control, 1982
• Structure and complexity of relational queries
  Journal of Computer and System Sciences, 1982
• Contributions to the Theory of Logic Programming
  Journal of the ACM, 1982
• A lattice-theoretical fixpoint theorem and its applications
  Pacific Journal of Mathematics, 1955