Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic #16)
by William Levine and Georgia Martin
From $96.79 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $94.59 at 100+
Total $2,419.75
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Built for school and campus orders
PDF quotes, purchase orders, tax exemption and multi-site delivery, handled by one account manager.
PDF quotes, purchase orders, tax exemption and help with vendor setup.
For schools Make it yoursBranded cover stickers on paperbacks from 100 copies, plus bookplates, inserts and belly bands. Your specialist confirms what fits your title.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment optionsBounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic #16)
Details
- Publisher
- Birkhäuser Boston
- Authors
- William Levine, Georgia Martin
- Format
- Paperback
- Published
- Jul 13, 2013
- ISBN-13
- 9781461268482
- Pages
- 353
- Printing
- Printed on demand
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic #16) for groups: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $96.79 | 12% off list |
| 50 – 99 | $95.69 | 13% off list |
| 100+ | $94.59 | 14% off list |
Popular for
A copy for every student in the class or section.
Shared reading for professional development.
Common reads and first-year programs.
Where can I buy 100 copies of Bounded Queries in Recursion Theory?
BookPal sells Bounded Queries in Recursion Theory in quantity. At 100 copies the price is $94.59 a copy, against a list price of $109.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.
- New books only, straight from the publisher
- Volume prices apply automatically in the cart, with no code needed
- Order at least 10 business days before you need the books (11 from mid-November through December)
What does Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic #16) cost when I buy for a group?
Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $96.79 (12% off list); 50 to 99 copies, $95.69 (13% off list); 100+ copies, $94.59 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.
How fast can I get copies of Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic #16)?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic #16)
Groups also order
A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.