The Resource Godel's Incompleteness Theorems

Godel's Incompleteness Theorems

Label
Godel's Incompleteness Theorems
Title
Godel's Incompleteness Theorems
Creator
Language
eng
Summary
1. The General Idea Behind Gdel's Proof2. Tarski's Theorem for Arithmetic3. The Incompleteness of Peano Arithmetic with Exponentation4. Arithmetic Without the Exponential5. Gdel's Proof Based on Consistency6. Rosser Systems7. Shepherdson's Representation Theorems8. Definability and Diagonalization9. The Unprovability of Consistency10. Some General Remarks on Provability and Truth11. Self-Referential Systems
Cataloging source
EBLCP
Dewey number
511.3
Index
no index present
LC call number
QA9.65 -- S69 1992eb
Literary form
non fiction
Nature of contents
dictionaries
Label
Godel's Incompleteness Theorems
Publication
http://library.link/vocab/branchCode
  • net
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • I: The General Idea Behind Gödel's Proof; I. Abstract Forms of Gödel's and Tarski's Theorems; II. Undecidable Sentences of L; II: Tarski's Theorem for Arithmetic; I. The Language L[sub(E)]; 1. Syntactic Preliminaries; 2. The Notion of Truth in L[sub(E)]; 3. Arithmetic and arithmetic Sets and Relations; II. Concatenation and Gödel Numbering; 4. Concatenation to the Base b; 5. Gödel Numbering; III. Tarski's Theorem; 6. Diagonalization and Gödel Sentences; III: The Incompleteness of Peano Arithmetic With Exponentiation; I. The Axiom System P.E.; 1. The Axiom System P.E
  • 1. Definability and Complete Representability2. Strong Definability of Functions in S; 3. Strong Definablity of Recursive Functions in (R); 4. Fixed Points and Gödel Sentences; 5. Truth Predicates; IX: The Unprovability of Consistency; 1. Provability Predicates; 2. The Unprovability of Consistency; 3. Henkin Sentences and Löb's Theorem; X: Some General Remarks on Provability and Truth; XI: Self-Referential Systems; I. Logicians Who Reason About Themselves; 1. An Analogue of the Tarski-Gödel Theorem; 2. Normal and Stable Reasoners of Type 1; 3. Rosser Type Reasoners
  • 4. The Consistency Problem5. Self-Fulfilling Beliefs and Löb's Theorem; II. Incompleteness Arguments in a General Setting; III. Systems of Type G; IV. Modal Systems; References; Index; A; C; D; E; F; G; I; K; L; M; N; P; Q; R; S; T; U; V; W; X
Control code
ocn935260459
Dimensions
unknown
Extent
1 online resource (156 pages)
Form of item
online
Isbn
9781601296412
Media category
computer
Media MARC source
rdamedia
Media type code
c
http://library.link/vocab/recordID
.b35773042
Specific material designation
remote
System control number
  • (OCoLC)935260459
  • pebcs160129641X

Library Locations

    • Deakin University Library - Geelong Waurn Ponds CampusBorrow it
      75 Pigdons Road, Waurn Ponds, Victoria, 3216, AU
      -38.195656 144.304955
Processing Feedback ...