| Record ID | marc_columbia/Columbia-extract-20221130-011.mrc:4038468:2009 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-011.mrc:4038468:2009?format=raw |
LEADER: 02009pam a22003494a 4500
001 5003898
005 20221109204803.0
008 020327t20042004ilu b 001 0 eng
010 $a 2002025765
020 $a1568811748
020 $a1568811756 (pbk.)
035 $a(OCoLC)ocm49531175
035 $a(NNC)5003898
035 $a5003898
040 $aDLC$cDLC$dYDX$dOrLoB-B
042 $apcc
050 00 $aQA9.56$b.F73 2004
082 00 $a511.3$221
100 1 $aFranzén, Torkel.$0http://id.loc.gov/authorities/names/n91058286
245 10 $aInexhaustibility :$ba non-exhaustive treatment /$cby Torkel Franzén.
260 $aUrbana, Ill. :$bAssociation for Symbolic Logic ;$aWellesley, Mass. :$bA K Peters,$c[2004], ©2004.
300 $axi, 251 pages ;$c23 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aLecture notes in logic ;$v16
504 $aIncludes bibliographical references (p. 243-244) and index.
505 00 $gCh. 1.$tIntroduction -- $gCh. 2.$tArithmetical preliminaries -- $gCh. 3.$tPrimes and proofs -- $gCh. 4.$tThe language of arithmetic -- $gCh. 5.$tThe language of analysis -- $gCh. 6.$tOrdinals and inductive definitions -- $gCh. 7.$tFormal languages and the definition of truth -- $gCh. 8.$tLogic and theories -- $gCh. 9.$tPeano arithmetic and computability -- $gCh. 10.$tElementary and classical analysis -- $gCh. 11.$tThe recursion theorem and ordinal notations -- $gCh. 12.$tThe incompleteness theorems -- $gCh. 13.$tIterated consistency -- $gCh. 14.$tIterated reflection -- $gCh. 15.$tIterated iteration and inexhaustibility.
650 0 $aIncompleteness theorems.$0http://id.loc.gov/authorities/subjects/sh85064795
650 0 $aLogic, Symbolic and mathematical.$0http://id.loc.gov/authorities/subjects/sh85078115
650 0 $aMathematics$xPhilosophy.$0http://id.loc.gov/authorities/subjects/sh85082153
830 0 $aLecture notes in logic ;$v16.$0http://id.loc.gov/authorities/names/n93082404
852 00 $bmat$hQA9.56$i.F73 2004