Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable (Q4557171)
From MaRDI portal
scientific article; zbMATH DE number 6986469
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable |
scientific article; zbMATH DE number 6986469 |
Statements
Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable (English)
0 references
29 November 2018
0 references
Gödel logic
0 references
resolution
0 references
many-valued logics
0 references
automated deduction
0 references
0 references
0 references
0 references
0 references
0 references
