Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable

DOI10.1007/978-3-319-26393-9_13zbMath1401.03036OpenAlexW2115252995MaRDI QIDQ4557171

Dušan Guller

Publication date: 29 November 2018

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26393-9_13

zbMATH Keywords

resolutionmany-valued logicsGödel logicautomated deduction

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35) Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results
• First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties
• On the refutational completeness of signed binary resolution and hyperresolution
• On expansions of WNM t-norm based logics with truth-constants
• Expanding the propositional logic of a t-norm with truth-constants: completeness results for rational semantics
• A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
• Theorem proving for prenex G\"odel logic with Delta: checking validity and unsatisfiability
• On Fuzzy Logic I Many‐valued rules of inference
• On Product Logic with Truth-constants
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• The \(L\Pi\) and \(L\Pi\frac 12\) logics: Two complete fuzzy systems joining Łukasiewicz and product logics

This page was built for publication: Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable