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.

• Type: Journal
• Year: 2016
• Where: FSS
• Authors: Mattia Bongini, Agata Ciabattoni, Franco Montagna
• Keywords: FPGA, FSS 2016