Request file

Review/Citation:  THAPEN, Neil. Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem. Archive for Mathematical Logic. 2011, 50(7-8), 665-680. ISSN 0933-5846. E-ISSN 1432-0665
Requested document:  Thapen1.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.