Complexity of sets obtained as values of propositional formulas (Q869787): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:26, 5 March 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
