| 000 | 00965camuu2200277 a 4500 | |
| 001 | 000000762925 | |
| 005 | 20020402115040 | |
| 008 | 901128m19919999gw a b 00 0 eng | |
| 010 | ▼a 90025702 | |
| 020 | ▼a 3540522360 (Springer-Verlag Berlin : v. 1 : acid-free paper) | |
| 020 | ▼a 0387522360 (Springer-Verlag New York : v. 1 : acid-free paper) | |
| 035 | ▼a KRIC00371475 | |
| 040 | ▼a 211032 ▼c 211032 ▼d 211009 | |
| 049 | 1 | ▼l 111211903 ▼v 1 |
| 050 | 0 0 | ▼a QA241 ▼b .S614 1991 |
| 082 | 0 0 | ▼a 512/.7 ▼2 21 |
| 090 | ▼a 512.7 ▼b S666i | |
| 100 | 1 | ▼a Smorynski, C. |
| 245 | 1 3 | ▼a Logical number theory : ▼b an introduction / ▼c Craig Smorynski. |
| 260 | ▼a Berlin ; ▼a New York : ▼b Springer-Verlag, ▼c c1991-. | |
| 300 | ▼a v. : ▼b ill. ; ▼c 24 cm. | |
| 490 | 0 | ▼a Universitext |
| 504 | ▼a Includes bibliographical references (v. 1, p. 390-393) and indexes. | |
| 650 | 0 | ▼a Number theory. |
| 650 | 0 | ▼a Logic, Symbolic and mathematical. |
Holdings Information
| No. | Location | Call Number | Accession No. | Availability | Due Date | Make a Reservation | Service |
|---|---|---|---|---|---|---|---|
| No. 1 | Location Main Library/Western Books/ | Call Number 512.7 S666i | Accession No. 111211903 | Availability Available | Due Date | Make a Reservation | Service |
Contents information
Table of Contents
I. Arithmetic Encoding.- 1. Polynomials.- 2. Sums of Powers.- 3. The Cantor Pairing function.- 4. The Fueter-Polya Theorem, I.- 5. The Fueter-Polya Theorem, II.- 6. The Chinese Remainder Theorem.- 7. The ?-Function and Other Encoding Schemes.- 8. Primitive Recursion.- 9. Ackermann Functions.- 10. Arithmetic Relations.- 11. Computability.- 12. Elementary Recursion Theory.- 13. The Arithmetic Hierarchy.- 14. Reading List.- II. Diophantine Encoding.- 1. Diophantine Equations; Some Background.- 2. Initial Results; The Davis-Putnam-Robinson Theorem.- 3. The Pell Equation, I.- 4. The Pell Equation, II.- 5. The Diophantine Nature of R.E. Relations.- 6. Applications.- 7. Forms.- 8. Binomial Coefficients.- 9. A Direct Proof of the Davis-Putnam-Robinson Theorem.- 10. The 3-Variable Exponential Diophantine Result.- 11. Reading List.- III. Weak Formal Theories of Arithmetic.- 1. Ignorabimus?.- 2. Formal Language and Logic.- 3. The Completeness Theorem.- 4. Presburger-Skolem Arithmetic; The Theory of Addition.- 5. Skolem Arithmetic; The Theory of Multiplication.- 6. Theories with + and ?; Incompleteness and Undecidability.- 7. Semi-Repiesentability of Functions.- 8. Further Undecidability Results.- 9. Reading List.- Index of Names.- Index of Subjects.
Information Provided By: :
