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 the normal view instead:
scientific article; zbMATH DE number 6021337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9132580757141112
0 references
0.8626037836074829
0 references
0.8041525483131409
0 references
0.7707132697105408
0 references
0.7659978866577148
0 references
