On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (Q5387294)
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: On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics |
scientific article; zbMATH DE number 5273182
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics |
scientific article; zbMATH DE number 5273182 |
Statements
On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (English)
0 references
8 May 2008
0 references
numerically definite syllogism
0 references
numerically definite relational syllogism
0 references
computational complexity
0 references
satisfiability problem
0 references
incompleteness
0 references
