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

DOI10.1016/J.FSS.2015.02.016zbMATH Open1390.03023OpenAlexW2119157651MaRDI QIDQ1697337FDOQ1697337

Authors: Mattia Bongini, Agata Ciabattoni, Franco Montagna 

Publication date: 19 February 2018

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2015.02.016

Recommendations

• Many-valued logics -- theorem proving problems
• scientific article; zbMATH DE number 2042617
• scientific article; zbMATH DE number 4002067
• scientific article; zbMATH DE number 3957059
• Resolution-based theorem proving for many-valued logics
• scientific article; zbMATH DE number 1754535
• Many-valued computational logics
• scientific article; zbMATH DE number 4049617
• Satisfiability in many-valued sentential logic is NP-complete
• On the complexity of entailment in propositional multivalued logics

zbMATH Keywords

many-valued logicsco-NP completenessrelational hypersequents

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Many-valued logic (03B50) Proof theory in general (including proof-theoretic semantics) (03F03) Decidability of theories and sets of sentences (03B25)

Cites Work

• Untersuchungen über das logische Schliessen. I
• Metamathematics of fuzzy logic
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• Display logic
• Title not available (Why is that?)
• Algebraizable logics
• \(n\)-contractive BL-logics
• Analytic calculi for product logics
• Sequent and hypersequent calculi for abelian and łukasiewicz logics
• Proof theory for locally finite many-valued logics: semi-projective logics
• Complexity of t-tautologies
• Title not available (Why is that?)
• MUltlog 1.0: Towards an expert system for many-valued logics
• The pure calculus of entailment
• Automated deduction for many-valued logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analytic Calculi for Logics of Ordinal Multiples of Standard t-Norms
• Logic for Programming, Artificial Intelligence, and Reasoning
• Title not available (Why is that?)
• A constructive analysis of RM
• Disjunction property and complexity of substructural logics
• On Computational Complexity of Semilinear Varieties
• Decomposition proof systems for Gödel-Dummett logics
• Finite-valued semantics for canonical labelled calculi
• Proof search in Hájek's basic logic

Cited In (5)

• Editorial
• Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form
• Title not available (Why is that?)
• On the completeness theorem for many-valued lattices
• Title not available (Why is that?)

Uses Software

• MUltlog

This page was built for publication: Proof search and co-NP completeness for many-valued logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697337)