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

DOI10.1016/J.FSS.2015.02.016MaRDI QIDQ1697337zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(6)

• Editorial
• Tree-like proof systems for finitely-many valued non-deterministic consequence relations
• scientific article; zbMATH DE number 3957059 (Why is no real title available?)
• On the completeness theorem for many-valued lattices
• scientific article; zbMATH DE number 2042614 (Why is no real title available?)
• Infinite-valued first-order Łukasiewicz logic: hypersequent calculi without structural rules and proof search for sentences in the prenex form

Describes a project that uses

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)