Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability

DOI10.2168/LMCS-8(1:20)2012zbMath1238.03021arXiv1202.6352OpenAlexW2025894783MaRDI QIDQ2881087

Christian G. Fermüller, Matthias Baaz, Agata Ciabattoni

Publication date: 3 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.6352

zbMATH Keywords

fuzzy logictheorem provingresolutionGödel logicHerbrand's theoremSkolemization\(\Delta\) modalitychaining calculus

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50)

Related Items (2)

Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable ⋮ Hyperresolution for Gödel logic with truth constants

This page was built for publication: Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability