Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices

DOI10.1007/3-540-61511-3_122zbMath1415.03030OpenAlexW1761663315MaRDI QIDQ4647557

Gernot Salzer

Publication date: 15 January 2019

Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61511-3_122

zbMATH Keywords

sequent calculusdisjunctive normal formconjunctive normal formpropositional formulapropositional variable

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50)

Related Items (5)

Binary resolution over Boolean lattices ⋮ Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) ⋮ Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach ⋮ MUltlog 1.0: Towards an expert system for many-valued logics ⋮ Non-distributive relatives of ETL and NFL

Uses Software

• MUltlog

Cites Work

• Unnamed Item
• 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
• MUltlog 1.0: Towards an expert system for many-valued logics
• Sequents in many valued logic I
• The Problem of Simplifying Truth Functions

This page was built for publication: Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices