Sciweavers

67
Voted
CSL
2000
Springer
14 years 8 months ago
On the Computational Interpretation of Negation
Abstract. We investigate the possibility of giving a computational interpretation of an involutive negation in classical natural deduction. We first show why this cannot be simply ...
Michel Parigot
AML
2005
76views more  AML 2005»
14 years 8 months ago
Perfect and bipartite IMTL-algebras and disconnected rotations of prelinear semihoops
IMTL logic was introduced in [12] as a generalization of the infinitely-valued logic of Lukasiewicz, and in [11] it was proved to be the logic of left-continuous t-norms with an i...
Carles Noguera, Francesc Esteva, Joan Gispert
FSS
2006
88views more  FSS 2006»
14 years 8 months ago
T-norm-based logics with an independent involutive negation
In this paper we investigate the addition of arbitrary independent involutive negations to t-norm based logics. We deal with several extensions of MTL and establish general comple...
Tommaso Flaminio, Enrico Marchioni
EUSFLAT
2003
126views Fuzzy Logic» more  EUSFLAT 2003»
14 years 10 months ago
On the complexity of propositional logics with an involutive negation
Let C be the propositional calculus given by a standard SBL-algebra; C  is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C  i...
Zuzana Haniková