Delineating classes of computational complexity via second order theories with weak set existence principles. I (Q4836045)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Delineating classes of computational complexity via second order theories with weak set existence principles. I |
scientific article; zbMATH DE number 762307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Delineating classes of computational complexity via second order theories with weak set existence principles. I |
scientific article; zbMATH DE number 762307 |
Statements
Delineating classes of computational complexity via second order theories with weak set existence principles. I (English)
0 references
8 June 1995
0 references
complexity classes
0 references
polynomial time hierarchy
0 references
provably recursive functions
0 references
second order theories
0 references
weak comprehension
0 references
bounded arithmetic
0 references
induction
0 references
bounded complexity
0 references
interpretability
0 references
0.812300980091095
0 references
0.7967833280563354
0 references
0.7857008576393127
0 references
