We extend a methodology by Baaz and Fermüller to systematically construct analytic calculi for semi-projective logics—a large family of (propositional) locally finite many-valued logics. Our calculi, defined in the framework of sequents of relations, are proof search oriented and can be used to settle the computational complexity of the formalized logics. As a case study we derive sequent calculi of relations for Nilpotent Minimum logic and for Hajek’s Basic Logic extended with the n-contraction axiom (n ≥ 1).
Ciabattoni, A., Montagna, F. (2013). Proof theory for locally finite many-valued logics: semi-projective logics. THEORETICAL COMPUTER SCIENCE, 480, 26-42 [10.1016/j.tcs.2013.02.003].
Proof theory for locally finite many-valued logics: semi-projective logics
MONTAGNA, FRANCO
2013-01-01
Abstract
We extend a methodology by Baaz and Fermüller to systematically construct analytic calculi for semi-projective logics—a large family of (propositional) locally finite many-valued logics. Our calculi, defined in the framework of sequents of relations, are proof search oriented and can be used to settle the computational complexity of the formalized logics. As a case study we derive sequent calculi of relations for Nilpotent Minimum logic and for Hajek’s Basic Logic extended with the n-contraction axiom (n ≥ 1).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/42912
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo