Admissible closures of polynomial time computable arithmetic

Author: Probst Dieter   Strahm Thomas  

Publisher: Springer Publishing Company

ISSN: 0933-5846

Source: Archive for Mathematical Logic, Vol.50, Iss.5-6, 2011-07, pp. : 643-660

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next