On the computational consequences of independence in propositional logic (Q2500830)
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 consequences of independence in propositional logic |
scientific article; zbMATH DE number 5047779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational consequences of independence in propositional logic |
scientific article; zbMATH DE number 5047779 |
Statements
On the computational consequences of independence in propositional logic (English)
0 references
18 August 2006
0 references
quantifier independence
0 references
satisfiability
0 references
validity
0 references
semantic game
0 references
independence-friendly propositional logics
0 references
computational complexity
0 references
decision problems
0 references
game theory
0 references
0.7858061194419861
0 references
0.7760085463523865
0 references
0.7755537033081055
0 references
0.774056077003479
0 references
