Introduction to the study of English history, by Samuel R. Gardiner ... and J. Bass Mullinger.Samuel Rawson Gardiner1903
3D Computer Graphics A Mathematical Introduction With OpenGL 1st Edition by Samuel R Buss ISBN 0521821037 9780521821032 Ebook Reconstructed Editionirybeozrvq5699
3-D Computer Graphics: A Mathematical Introduction with OpenGLby Samuel R. BussHansford · Society for Industrial and Applied Mathematics2004PDF369 KB
Samuel R. Buss. First-order Proof Theory of Arithmetic. Handbook of Proof Theory, Edited by Samuel R. Buss, Studies in Logic and the Foundations of Mathematics, Vol. 137, Elsevier, Amsterdam Etc. 1998, Pp. 79–147.Arai · Bulletin of Symbolic Logic2000PDF202 KB
Samuel R. Buss. An Introduction to Proof Theory. Handbook of Proof Theory, Edited by Samuel R. Buss, Studies in Logic and the Foundations of Mathematics, Vol. 137, Elsevier, Amsterdam Etc. 1998, P. V., Pp. 1–78.Arai · Bulletin of Symbolic Logic2000PDF139 KB
The Superjump in Martin-Löf Type Theoryby Michael Rathjen; Samuel R. Buss; Petr Hájek; Pavel PudlákMöllerfeld · Bulletin of Symbolic Logic2002PDF222 KB
Buss Samuel R.. The Undecidability of K-provability. Annals of Pure and Applied Logic, Vol. 53 (1991), Pp. 75–102Carbone · Journal of Symbolic Logic1997PDF332 KB
Jeremy Avigad and Solomon Feferman. Gödel's functional (“Dialectica”) interpretation. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 337–405.Arai · Bulletin of Symbolic Logic2000PDF110 KB
Jäger Gerhard and Stärk Robert F.. A proof-theoretic framework for logic programming. Handbook of proof theory, edited by Buss Samuel R., Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 639–682Arai · Bulletin of Symbolic Logic2000PDF133 KB
Proof complexity and feasible arithmetics, DIMACS workshop, April 21–24, 1996, edited by Beame Paul W. and Buss Samuel R., Series in discrete mathematics and theoretical computer science, vol. 39, American Mathematical Society, Providence 1998, xii + 320 ppRazborov · Association for Symbolic Logic1999PDF426 KB
Krajíček Jan, Pudlák Pavel, and Takeuti Gaisi. Bounded arithmetic and the polynomial hierarchy. Ibid., vol. 52 (1991), pp. 143–153.Buss Samuel R.. Relating the bounded arithmetic and polynomial time hierarchies. Ibid., vol. 75 (1995), pp. 67–77.Zambella Domenico. Notes on polynomially bounded arithmetic. The journal of symbolic logic, vol. 61 (1996), pp. 942–966Cook · Journal of Symbolic Logic1999PDF426 KB
Jeremy Avigad. A realizability interpretation for classical arithmetic . Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Hájek, and Pavel Pudák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2000,…Berger · Bulletin of Symbolic Logic2002PDF81 KB
