컨텐츠로 이동
An introduction to Gödel's Theorems 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

An introduction to Gödel's Theorems

저자: Peter Smith
출판사: Cambridge : Cambridge University Press, 2007.
시리즈: Cambridge introductions to philosophy.
판/형식:   Print book : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
Peter Smith examines Gödel's Theorems, how they were established and why they matter. This is an ideal textbook for philosophy and mathematics students taking a first course in mathematical logic. A companion website is included with exercises.
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

장르/형태: Einführung
명시된 사람: Kurt Gödel; Kurt Gödel
자료 유형: 인터넷 자료
문서 형식: 책, 인터넷 자원
모든 저자 / 참여자: Peter Smith
ISBN: 9780521857840 0521857848 9780521674539 0521674530
OCLC 번호: 124025603
설명: xiv, 361 pages ; 26 cm.
내용: What Godel's theorems say --
Decidability and enumerability --
Axiomatized formal theories --
Capturing numerical properties --
The truths of arithmetic --
Sufficiently strong arithmetics --
Interlude: taking stock --
Two formalized arithmetics --
What q can prove --
First-order peano arithmetic --
Primitive recursive functions --
Capturing p r functions --
Q is p.r. adequate --
Interlude: a very little about Principia --
The arithmetization of syntax --
PA is incomplete --
Godel's first theorem --
Interlude: about the first theorem --
Strengthening the first theorem --
The diagonalization lemma --
Using the diagonalization lemma --
Second-order arithmetics --
Interlude: incompleteness and Isaacson's conjecture --
Godel's second theorem for PA --
The derivability conditions --
Deriving the derivability conditions --
Reflections --
Interlude: about the second theorem --
Recursive functions --
Undecidability and incompleteness --
Turing machines --
Turing machines and recursiveness --
Halting problems --
The church-turing thesis --
Proving the thesis.
일련 제목: Cambridge introductions to philosophy.
책임: Peter Smith.
더 많은 정보:

초록:

Peter Smith examines Gödel's Theorems, how they were established and why they matter. This is an ideal textbook for philosophy and mathematics students taking a first course in mathematical logic. A companion website is included with exercises.

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


Primary Entity

<http://www.worldcat.org/oclc/124025603> # An introduction to Gödel's Theorems
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "124025603" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/119737250#Place/cambridge> ; # Cambridge
   schema:about <http://dewey.info/class/511.3/e22/> ;
   schema:about <http://viaf.org/viaf/97851774> ; # Kurt Gödel
   schema:about <http://experiment.worldcat.org/entity/work/data/119737250#Topic/mathematical_logic_and_foundations> ; # Mathematical logic and foundations
   schema:about <http://experiment.worldcat.org/entity/work/data/119737250#Person/godel_kurt> ; # Kurt Gödel
   schema:about <http://experiment.worldcat.org/entity/work/data/119737250#Topic/symbolisk_logik> ; # Symbolisk logik
   schema:about <http://id.worldcat.org/fast/1002068> ; # Logic, Symbolic and mathematical
   schema:about <http://experiment.worldcat.org/entity/work/data/119737250#Topic/godelscher_unvollstandigkeitssatz> ; # Gödelscher Unvollständigkeitssatz
   schema:bookFormat bgn:PrintBook ;
   schema:creator <http://viaf.org/viaf/98223624> ; # Peter Smith
   schema:datePublished "2007" ;
   schema:description "What Godel's theorems say -- Decidability and enumerability -- Axiomatized formal theories -- Capturing numerical properties -- The truths of arithmetic -- Sufficiently strong arithmetics -- Interlude: taking stock -- Two formalized arithmetics -- What q can prove -- First-order peano arithmetic -- Primitive recursive functions -- Capturing p r functions -- Q is p.r. adequate -- Interlude: a very little about Principia -- The arithmetization of syntax -- PA is incomplete -- Godel's first theorem -- Interlude: about the first theorem -- Strengthening the first theorem -- The diagonalization lemma -- Using the diagonalization lemma -- Second-order arithmetics -- Interlude: incompleteness and Isaacson's conjecture -- Godel's second theorem for PA -- The derivability conditions -- Deriving the derivability conditions -- Reflections -- Interlude: about the second theorem -- Recursive functions -- Undecidability and incompleteness -- Turing machines -- Turing machines and recursiveness -- Halting problems -- The church-turing thesis -- Proving the thesis."@en ;
   schema:description "Peter Smith examines Gödel's Theorems, how they were established and why they matter. This is an ideal textbook for philosophy and mathematics students taking a first course in mathematical logic. A companion website is included with exercises."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/119737250> ;
   schema:genre "Einführung"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/119737250#Series/cambridge_introductions_to_philosophy> ; # Cambridge introductions to philosophy.
   schema:name "An introduction to Gödel's Theorems"@en ;
   schema:productID "124025603" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/124025603#PublicationEvent/cambridge_cambridge_university_press_2007> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/119737250#Agent/cambridge_university_press> ; # Cambridge University Press
   schema:url <http://catdir.loc.gov/catdir/enhancements/fy0803/2007299862-t.html> ;
   schema:workExample <http://worldcat.org/isbn/9780521857840> ;
   schema:workExample <http://worldcat.org/isbn/9780521674539> ;
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA733037> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/124025603> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/119737250#Agent/cambridge_university_press> # Cambridge University Press
    a bgn:Agent ;
   schema:name "Cambridge University Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/119737250#Person/godel_kurt> # Kurt Gödel
    a schema:Person ;
   schema:familyName "Gödel" ;
   schema:givenName "Kurt" ;
   schema:name "Kurt Gödel" ;
    .

<http://experiment.worldcat.org/entity/work/data/119737250#Series/cambridge_introductions_to_philosophy> # Cambridge introductions to philosophy.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/124025603> ; # An introduction to Gödel's Theorems
   schema:name "Cambridge introductions to philosophy." ;
   schema:name "Cambridge introductions to philosophy" ;
    .

<http://experiment.worldcat.org/entity/work/data/119737250#Topic/godelscher_unvollstandigkeitssatz> # Gödelscher Unvollständigkeitssatz
    a schema:Intangible ;
   schema:name "Gödelscher Unvollständigkeitssatz"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/119737250#Topic/mathematical_logic_and_foundations> # Mathematical logic and foundations
    a schema:Intangible ;
   schema:name "Mathematical logic and foundations"@en ;
    .

<http://id.worldcat.org/fast/1002068> # Logic, Symbolic and mathematical
    a schema:Intangible ;
   schema:name "Logic, Symbolic and mathematical"@en ;
    .

<http://viaf.org/viaf/97851774> # Kurt Gödel
    a schema:Person ;
   schema:familyName "Gödel" ;
   schema:givenName "Kurt" ;
   schema:name "Kurt Gödel" ;
    .

<http://viaf.org/viaf/98223624> # Peter Smith
    a schema:Person ;
   schema:birthDate "1944" ;
   schema:familyName "Smith" ;
   schema:givenName "Peter" ;
   schema:name "Peter Smith" ;
    .

<http://worldcat.org/isbn/9780521674539>
    a schema:ProductModel ;
   schema:isbn "0521674530" ;
   schema:isbn "9780521674539" ;
    .

<http://worldcat.org/isbn/9780521857840>
    a schema:ProductModel ;
   schema:isbn "0521857848" ;
   schema:isbn "9780521857840" ;
    .


Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.