Complexity of sets obtained as values of propositional formulas (Q869787): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:30, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of sets obtained as values of propositional formulas |
scientific article |
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
