![]() |
|
Logical Number Theory I [Smoryński] - Printable Version +- MKLab (https://mklab.gr) +-- Forum: [INDEX] (https://mklab.gr/forumdisplay.php?fid=1) +--- Forum: MATHEMATICS (https://mklab.gr/forumdisplay.php?fid=3) +---- Forum: BOOKS (https://mklab.gr/forumdisplay.php?fid=6) +----- Forum: NEW BOOKS (https://mklab.gr/forumdisplay.php?fid=42) +------ Forum: FOREIGN (https://mklab.gr/forumdisplay.php?fid=91) +------- Forum: PURE AND APPLIED MATHS (https://mklab.gr/forumdisplay.php?fid=94) +-------- Forum: NUMBER THEORY (https://mklab.gr/forumdisplay.php?fid=169) +-------- Thread: Logical Number Theory I [Smoryński] (/showthread.php?tid=2017) |
Logical Number Theory I [Smoryński] - mklabgr - 09-15-2026 Logical Number Theory I: An Introduction by Craig Smoryński is a 1991 Springer textbook that explores number theory from the perspective of mathematical logic. Rather than treating number theory primarily as the study of primes, congruences, or equations, it examines how arithmetic can be represented, formalized, and reasoned about within logical systems. The book provides an undergraduate-level introduction to first-order logic, recursion theory, completeness, incompleteness, computability, and undecidability, while connecting these subjects directly to arithmetic. A major focus is the logical treatment of Diophantine equations and decision problems. The second chapter, Diophantine Encoding, investigates how mathematical statements and computational processes can be encoded using integer equations, leading toward deep results concerning the limits of algorithmic problem-solving. The final chapter, Weak Formal Theories of Arithmetic, examines what can and cannot be proved in relatively weak arithmetic systems. With numerous exercises and historical commentary, the book presents number theory as a meeting point between arithmetic, logic, computation, proof, and the fundamental limits of mathematics. BOOK |