Number of the records: 1
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
- 1.Thapen, Neil
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.
Archive for Mathematical Logic. Roč. 50, 7-8 (2011), s. 665-680. ISSN 0933-5846. E-ISSN 1432-0665
Impact factor: 0.341, year: 2011
http://www.springerlink.com/content/l19kr20362065t86/
http://hdl.handle.net/11104/0203691
Number of the records: 1