Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy (Q5865564)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7538955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy |
scientific article; zbMATH DE number 7538955 |
Statements
Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy (English)
0 references
9 June 2022
0 references
computational complexity
0 references
descriptive complexity
0 references
mathematical logic
0 references
graph theory
0 references
0.8180390000343323
0 references
0.7136011719703674
0 references
0.712304949760437
0 references
0.7101811170578003
0 references
0.7101811170578003
0 references
