Probst, Dieter; Strahm, Thomas (2011). Admissible closures of polynomial time computable arithmetic. Archive for mathematical logic, 50(5-6), pp. 643-660. Berlin: Springer-Verlag 10.1007/s00153-011-0238-7
|
Text
153_2011_Article_238.pdf - Published Version Available under License Publisher holds Copyright. Download (258kB) | Preview |
Item Type: |
Journal Article (Original Article) |
|---|---|
Division/Institute: |
08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG) 08 Faculty of Science > Institute of Computer Science (INF) |
UniBE Contributor: |
Probst, Dieter (A), Strahm, Thomas Adrian |
ISSN: |
0933-5846 |
Publisher: |
Springer-Verlag |
Language: |
English |
Submitter: |
Factscience Import |
Date Deposited: |
04 Oct 2013 14:27 |
Last Modified: |
29 Mar 2023 23:32 |
Publisher DOI: |
10.1007/s00153-011-0238-7 |
Web of Science ID: |
000291162500010 |
BORIS DOI: |
10.7892/boris.9986 |
URI: |
https://boris.unibe.ch/id/eprint/9986 (FactScience: 215809) |
Actions (login required)
 |
Edit item |