\(\mathrm{SO}^F\): a semantic restriction over second-order logic and its polynomial-time hierarchy (Q3224003)
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 6013580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\mathrm{SO}^F\): a semantic restriction over second-order logic and its polynomial-time hierarchy |
scientific article; zbMATH DE number 6013580 |
Statements
SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy (English)
0 references
9 March 2012
0 references
finite model theory
0 references
descriptive complexity
0 references
relational machines
0 references
0.8350803256034851
0 references
0.7960354089736938
0 references
0.7740049958229065
0 references
0.7666174173355103
0 references
0.763933539390564
0 references
