CONSTRUCTIVE NEGATION AND INTERNAL AXIOMA TICS

We propose in this work a mathematical aspect of Constructive Negation for constraint general logic programs. We can then obtain a completio n theorem (soundness and completeness) with internal axiomatization of general program, in the classical logic deduction frame: the bivalued models.