Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Dieter Probst, Thomas Strahm. Admissible closures of polynomial time computable arithmetic. Arch. Math. Log., 50(5-6):643-660, 2011. [doi]
No references recorded for this publication.
No citations of this publication recorded.