Optimal axiomatizations of finitely valued logics

DOI10.1006/inco.1999.2862zbMath1006.03020OpenAlexW2080066850MaRDI QIDQ1854378

Gernot Salzer

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2862

zbMATH Keywords

sequent calculusnatural deductionpropositional resolutionfinite-valued logicclause formationoptimal axiomatizationsoptimal tableaux

Mathematics Subject Classification ID

Related Items (3)

Binary resolution over Boolean lattices ⋮ Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC ⋮ Two-sided sequent calculi for \textit{FDE}-like four-valued logics

Uses Software

• MUltlog

Cites Work

• Unnamed Item
• Unnamed Item
• Commodious axiomatization of quantifiers in multiple-valued logic
• Resolution-based theorem proving for many-valued logics
• On a generalization of quantifiers
• Systematization of finite many-valued logics through the method of tableaux
• Short Conjunctive Normal Forms in Finitely Valued Logics
• MUltlog 1.0: Towards an expert system for many-valued logics
• Sequents in many valued logic I
• The Problem of Simplifying Truth Functions
• Axiom schemes for m-valued propositions calculi

This page was built for publication: Optimal axiomatizations of finitely valued logics