Počet záznamů: 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. 2011, 50(7-8), 665-680. ISSN 0933-5846. E-ISSN 1432-0665. Dostupné z: doi: 10.1007/s00153-011-0240-0.
Počet záznamů: 1