We study the computational content of negation in classical logic. This is done in the framework of the ∗X calculus, which has been designed to stand in correspondence with classical logic with explicit structural rules. The terms for left-negation and right-negation are introduced, and their computational role is defined by reduction rules. We show that the good underlying properties of the original system are preserved in the system extended with negations.
Classical computation with negation
Dragisa Zunic;
2012-01-01
Abstract
We study the computational content of negation in classical logic. This is done in the framework of the ∗X calculus, which has been designed to stand in correspondence with classical logic with explicit structural rules. The terms for left-negation and right-negation are introduced, and their computational role is defined by reduction rules. We show that the good underlying properties of the original system are preserved in the system extended with negations.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
