Complexity of sets obtained as values of propositional formulas (Q869787): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/b:matn.0000015028.10892.68 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054594741 / rank | |||
Normal rank |
Latest revision as of 11:05, 30 July 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