Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability (Q2881087)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability |
scientific article; zbMATH DE number 6021337
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability |
scientific article; zbMATH DE number 6021337 |
Statements
3 April 2012
0 references
Gödel logic
0 references
\(\Delta\) modality
0 references
theorem proving
0 references
fuzzy logic
0 references
Skolemization
0 references
Herbrand's theorem
0 references
resolution
0 references
chaining calculus
0 references
Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability (English)
0 references
