ISBN: 9780243176175 - Diophantine Sets Over Polynomial Rings (classic Reprint) (3 results)

- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 21.62
Free ShippingShips within U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 20.23
£ 3.29 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
More images- Softcover
- Print on Demand
Seller: Forgotten Books, London, United KingdomForgotten Books
Contact seller5-star sellerCondition: New
£ 13.58
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. No Jacket. Print on Demand. Explore the limits of algorithmic problem solving with a deep dive into Diophantine sets over polynomial rings. This work surveys how famous questions like Hilbert's tenth problem connect to the classification of solvable equations and the reach of computability in algebraic settings.The text outlines key results and methods from the field, focusing on how recursively enumerable sets relate to Diophantine definitions over polynomial rings. It presents logical consequences, lemmas about Pell's equation, and the role of Julia Robinson predicates in establishing broad Diophantine reaches. While technical, the material stays centered on core ideas about what can be defined and decided in these algebraic structures, and what that means for understanding solvability.- Learn how Diophantine definitions behave over polynomial rings and what that implies for undecidability.- See how classical equations like Pell's equation appear in this context and what they reveal about solutions.- Understand the role of predicates and reductions in linking computability to number-theoretic questions.- Get a sense of the logical progression from lemmas to major theorems in this area.Ideal for readers who want a rigorous look at the connections between computability, logic, and algebra, and who are comfortable with advanced math concepts. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…