Complexity of sets obtained as values of propositional formulas (Q869787)
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: Complexity of sets obtained as values of propositional formulas |
scientific article; zbMATH DE number 5132506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of sets obtained as values of propositional formulas |
scientific article; zbMATH DE number 5132506 |
Statements
Complexity of sets obtained as values of propositional formulas (English)
0 references
9 March 2007
0 references
Kolmogorov complexity
0 references
logical connectives
0 references
law of weak excluded middle
0 references
deducibility
0 references
intuitionistic logic
0 references
propositional calculus
0 references
0.8134843707084656
0 references
0.7676509022712708
0 references
0.7582206130027771
0 references
