Admissible closures of polynomial time computable arithmetic
Work
Year: 2011
Type: article
Source: Archive for Mathematical Logic
Authors Dieter Probst, Thomas Strahm
Cites: 18
Cited by: 1
Related to: 10
FWCI: 0.277
Citation percentile (by year/subfield): 39.12
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed