Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem

Number of the records: 1

1.

SYSNO	0369682
Title	Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Author(s)	Thapen, Neil (MU-W)_{RID, SAI}
Source Title	Archive for Mathematical Logic. Roč. 50, 7-8 (2011), s. 665-680. - : Springer
Document Type	Článek v odborném periodiku
Grant	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
	LC505 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
	1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	DE
Keywords	bounded arithmetic * proof complexity * search problems
URL	http://www.springerlink.com/content/l19kr20362065t86/
Permanent Link	http://hdl.handle.net/11104/0203691

	File	Download	Size	Commentary	Version	Access
	Thapen1.pdf	1	239.5 KB		Publisher’s postprint	require

Number of the records: 1