Matches in Harvard for { <http://id.lib.harvard.edu/aleph/006899605/catalog> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- catalog contributor b9574802.
- catalog contributor b9574803.
- catalog created "c1995.".
- catalog date "1995".
- catalog date "c1995.".
- catalog dateCopyrighted "c1995.".
- catalog description "1. The Framework of Logic. 1.1. Induction. 1.2. Sentential Logic. 1.3. First Order Logic. 1.4. Proof Systems -- 2. Completeness. 2.1. Enumerability. 2.2. The Completeness Theorem. 2.3. Nonstandard Models of Arithmetic -- 3. Model Theory. 3.1. Elementary Substructures and Chains. 3.2. Ultraproducts and Compactness. 3.3. Types and Countable Models -- 4. The Incompleteness Theorem. 4.1. The Language of Peano Arithmetic. 4.2. The Axioms of Peano Arithmetic. 4.3. Basic Theorems of Number Theory in PA. 4.4. Encoding Finite Sequences of Numbers. 4.5. Godel Numbers. 4.6. Substitution. 4.7. The Incompleteness Theorem. 4.8. Other Axiom Systems. 4.9. Bounded Formulas. 4.10. A Finer Analysis of 4.4 and 4.5. 4.11. More on Recursive Sets and Functions.".
- catalog extent "xiii, 247 p. :".
- catalog hasFormat "Incompleteness phenomenon.".
- catalog identifier "1568810296".
- catalog isFormatOf "Incompleteness phenomenon.".
- catalog issued "1995".
- catalog issued "c1995.".
- catalog language "eng".
- catalog publisher "Wellesley, Mass. : A K Peters,".
- catalog relation "Incompleteness phenomenon.".
- catalog subject "511.3 20".
- catalog subject "Incompleteness theorems.".
- catalog subject "QA9.54 .J83 1995".
- catalog tableOfContents "1. The Framework of Logic. 1.1. Induction. 1.2. Sentential Logic. 1.3. First Order Logic. 1.4. Proof Systems -- 2. Completeness. 2.1. Enumerability. 2.2. The Completeness Theorem. 2.3. Nonstandard Models of Arithmetic -- 3. Model Theory. 3.1. Elementary Substructures and Chains. 3.2. Ultraproducts and Compactness. 3.3. Types and Countable Models -- 4. The Incompleteness Theorem. 4.1. The Language of Peano Arithmetic. 4.2. The Axioms of Peano Arithmetic. 4.3. Basic Theorems of Number Theory in PA. 4.4. Encoding Finite Sequences of Numbers. 4.5. Godel Numbers. 4.6. Substitution. 4.7. The Incompleteness Theorem. 4.8. Other Axiom Systems. 4.9. Bounded Formulas. 4.10. A Finer Analysis of 4.4 and 4.5. 4.11. More on Recursive Sets and Functions.".
- catalog title "The incompleteness phenomenon : a new course in mathematical logic / Martin Goldstern, Haim Judah.".
- catalog type "text".