Back to Search Start Over

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

Authors :
Mattia Bongini
Franco Montagna
Agata Ciabattoni
Source :
Fuzzy Sets and Systems. 292:130-149
Publication Year :
2016
Publisher :
Elsevier BV, 2016.

Abstract

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 Godel, Łukasiewicz and Product Logic, as well as Hajek's Basic Fuzzy Logic.

Subjects

Subjects :
Discrete mathematics
Logic
010102 general mathematics
Classical logic
0102 computer and information sciences
MV-algebra
01 natural sciences
Fuzzy logic
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
010201 computation theory & mathematics
Artificial Intelligence
Monoidal t-norm logic
Calculus
0101 mathematics
T-norm fuzzy logics
Completeness (statistics)
Principle of bivalence
Łukasiewicz logic
Mathematics

Details

ISSN :
01650114
Volume :
292
Database :
OpenAIRE
Journal :
Fuzzy Sets and Systems
Accession number :
edsair.doi...........dda7794ccb28fee4414405f6b5b3a3fe
Full Text :
https://doi.org/10.1016/j.fss.2015.02.016
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details