Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Unsatisfiable Formulae of Gödel Logic with Truth Constants and , , Are Recursively Enumerable
verfasst von : Dušan Guller
Erschienen in: Advances in Swarm and Computational Intelligence
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper brings a solution to the open problem of recursive enumerability of unsatisfiable formulae in the first-order Gödel logic. The answer is affirmative even for a useful expansion by intermediate truth constants and the equality,
, strict order,
$$\prec $$
, projection
$$\Delta $$
operators. The affirmative result for unsatisfiable prenex formulae of
$$G_\infty ^\Delta $$
has been stated in [
1
]. In [
7
], we have generalised the well-known hyperresolution principle to the first-order Gödel logic for the general case. We now propose a modification of the hyperresolution calculus suitable for automated deduction with explicit partial truth.