Lower bounds for invariant queries in logics with counting. (Q1853505): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00152-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063991224 / rank | |||
Normal rank |
Revision as of 10:44, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds for invariant queries in logics with counting. |
scientific article |
Statements
Lower bounds for invariant queries in logics with counting. (English)
0 references
21 January 2003
0 references
complexity classes
0 references
descriptive complexity
0 references
expressive power
0 references
counting logics
0 references
first-order logic with counting
0 references