Admissible closures of polynomial time computable arithmetic (Q634777): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S00153-011-0238-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00153-011-0238-7 / rank | |||
Normal rank | |||
Revision as of 23:07, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Admissible closures of polynomial time computable arithmetic |
scientific article |
Statements
Admissible closures of polynomial time computable arithmetic (English)
0 references
16 August 2011
0 references
polynomial-time computable arithmetic
0 references
Kripke-Platek set theory
0 references
second-order arithmetic
0 references
