Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

FSS
2016

favoriteEmaildiscussreport

60views FPGA» more FSS 2016»

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

8 years 25 days ago

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

Download www.logic.at

We provide a methodology to introduce proof search oriented calculi for a large class of many-valued logics, and a suﬃcient 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

Real-time Traffic

FPGA | FSS 2016 |

claim paper

Related Content

» From Proofs to Focused Proofs A Modular Proof of Focalization in Linear Logic

» Focusing and Polarization in Intuitionistic Logic

» EMatching with Free Variables

» Geometric Resolution A Proof Procedure Based on Finite Model Search

» Proof Search and CounterModel Construction for Biintuitionistic Propositional Logic with L...

» Proof Search in Minimal Logic

» A Matrix Characterization for MELL

» CutElimination and Proof Search for BiIntuitionistic Tense Logic

» Extended FirstOrder Logic

» Free Variable Tableaux for Propositional Modal Logics

Post Info
More Details (n/a)

Added	03 Apr 2016
Updated	03 Apr 2016
Type	Journal
Year	2016
Where	FSS
Authors	Mattia Bongini, Agata Ciabattoni, Franco Montagna

Comments (0)