Delineating classes of computational complexity via second order theories with weak set existence principles. I
From MaRDI portal
Publication:4836045
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 65757 (Why is no real title available?)
- scientific article; zbMATH DE number 4053608 (Why is no real title available?)
- Characterising polynomial time computable functions using theories with weak set existence principles
- Theories with self-application and computational complexity.
- scientific article; zbMATH DE number 176204 (Why is no real title available?)
- Intrinsic theories and computational complexity
- On parallel hierarchies and R ki
- New Computational Paradigms
- Arithmetic theories for computational complexity problems
- scientific article; zbMATH DE number 4134036 (Why is no real title available?)
- Techniques in weak analysis for conservation results
- Complexity hierarchies beyond elementary
This page was built for publication: Delineating classes of computational complexity via second order theories with weak set existence principles. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836045)