We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments ...
The Bulletin of Symbolic Logic, Vol. 28, No. 3 (SEPTEMBER 2022), pp. 451-465 (15 pages) L. D. Beklemishev, Induction rules, reflection principles, and provably ...
Randolph Grace receives funding from the Marsden Fund, administered by the Royal Society of New Zealand. University of Canterbury provides funding as a member of The Conversation AU. University of ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback