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 ...
Shapiro, Benson P. "Note on Marketing Arithmetic and Related Marketing Terms, Answers to Exercises." Harvard Business School Supplement 581-143, April 1981. (Revised October 1982.) ...
THE total number of distinct primes which divide a given number I call its Manifoldness or Multiplicity. You have full access to this article via your institution.
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback