A Generalisation of the Hyperresolution Principle to First Order Gödel Logic

DOI10.1007/978-3-319-11271-8_11MaRDI QIDQ2829667zbMATH OpenOpenAlexFDO

Authors Dušan Guller

Publication date 8 November 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-11271-8_11

zbMATH Keywords

resolutionautomated deductionmany-valued logicsGödel logic

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Mechanization of proofs and logical operations (03B35)

Recommendations

• Hyperresolution for Gödel logic with truth constants
• First-order Gödel logics
• A multiple-conclusion calculus for first-order Gödel logic
• On the classification of first order Gödel logics
• On the compactness property of extensions of first-order Gödel logic
• A non-hyperarithmetical Gödel logic
• Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
• Compactness in first-order Gödel logics
• scientific article; zbMATH DE number 1980935
• A resolution mechanism for prenex Gödel logic

Cites work

• scientific article; zbMATH DE number 1303351 (Why is no real title available?)
• A resolution mechanism for prenex Gödel logic
• A structure-preserving clause form translation
• An optimality result for clause form translation
• Herbrand's theorem for prenex Gödel logic and its consequences for theorem proving
• Hypersequent Calculi for Godel Logics -- a Survey
• Ordered chaining calculi for first-order theories of transitive relations
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• Short Conjunctive Normal Forms in Finitely Valued Logics

Cited in

(8)

• An analysis of Ruspini partitions in Gödel logic
• scientific article; zbMATH DE number 7340563 (Why is no real title available?)
• A semantic proof of strong cut-admissibility for first-order Godel logic
• Hyperresolution for Gödel logic with truth constants
• Automated deduction in Gödel logic
• A resolution mechanism for prenex Gödel logic
• Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable
• A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains

This page was built for publication: A Generalisation of the Hyperresolution Principle to First Order Gödel Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829667)