Proof theory for locally finite many-valued logics: semi-projective logics

DOI10.1016/j.tcs.2013.02.003zbMath1322.03019OpenAlexW2127779282WikidataQ39623390 ScholiaQ39623390MaRDI QIDQ385019

Agata Ciabattoni, Franco Montagna

Publication date: 29 November 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.003

zbMATH Keywords

computational complexitymany-valued logicbasic logicanalytic calculifirst-order logicsnilpotent minimum logicsequents of relations

Mathematics Subject Classification ID

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

Related Items

Franco Montagna's work on provability logic and many-valued logic ⋮ Compositional meaning in logic ⋮ Proof search and co-NP completeness for many-valued logics ⋮ Obituary: Franco Montagna (1948--2015) ⋮ Hypersequent and display calculi -- a unified perspective

Uses Software

• MUltlog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(n\)-contractive BL-logics
• T-norm-based logics with an independent involutive negation
• Canonicity in subvarieties of BL-algebras
• Metamathematics of fuzzy logic
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• Algebraic foundations of many-valued reasoning
• Residuated fuzzy logics with an involutive negation
• Proof theory for fuzzy logics
• Ordered chaining calculi for first-order theories of transitive relations
• On theories and models in fuzzy predicate logics
• Algebraizable logics
• MUltlog 1.0: Towards an expert system for many-valued logics
• Analytic Calculi for Logics of Ordinal Multiples of Standard t-Norms
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Proof theory for locally finite many-valued logics: semi-projective logics