We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows for the computerized discovery of new fuzzy logics. © 2012 Springer-Verlag.
Standard completeness for extensions of MTL: An automated approach
Baldi P.
;
2012-01-01
Abstract
We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows for the computerized discovery of new fuzzy logics. © 2012 Springer-Verlag.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
20. Standard Completeness for Extensions of MTL-An Automated Approach.pdf
solo utenti autorizzati
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
280.15 kB
Formato
Adobe PDF
|
280.15 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
