Sciweavers

Share
FSS
2016

Proof search and Co-NP completeness for many-valued logics

3 years 21 days ago
Proof search and Co-NP completeness for many-valued logics
We provide a methodology to introduce proof search oriented calculi for a large class of many-valued logics, and a sufficient condition for their Co-NP completeness. Our results apply to many well known logics including G¨odel, Lukasiewicz and Product Logic, as well as H´ajek’s Basic Fuzzy Logic.
Mattia Bongini, Agata Ciabattoni, Franco Montagna
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where FSS
Authors Mattia Bongini, Agata Ciabattoni, Franco Montagna
Comments (0)
books