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

DOI10.1016/j.fss.2015.02.016zbMath1390.03023OpenAlexW2119157651MaRDI QIDQ1697337

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) Decidability of theories and sets of sentences (03B25) Many-valued logic (03B50) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items

Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form ⋮ Editorial

Uses Software

• MUltlog

Cites Work

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