The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/malq.200910111 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144615401 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The computational complexity of logical theories / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4215637 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4131648 / rank | |||
Normal rank | |||
Latest revision as of 15:48, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The quantifier complexity of polynomial-size iterated definitions in first-order logic |
scientific article |
Statements
The quantifier complexity of polynomial-size iterated definitions in first-order logic (English)
0 references
10 January 2011
0 references
iterated definition
0 references
recursive definition
0 references
quantifier complexity
0 references
finite quantifier
0 references
