| Record ID | marc_columbia/Columbia-extract-20221130-002.mrc:118277118:1661 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-002.mrc:118277118:1661?format=raw |
LEADER: 01661cam a2200397 a 4500
001 595890
005 20220525204520.0
008 870917r19861985it b 001 0 eng d
020 $a8870881504$cL45.000
035 $a(OCoLC)17649713
035 $a(OCoLC)ocm17649713
035 $a(CStRLIN)NYCG87-B75675
035 $9ACQ0415CU
035 $a(NNC)595890
035 $a595890
040 $aNNC$cNNC
090 $aQA9.59$b.B87 1986g
100 1 $aBuss, Samuel R.$0http://id.loc.gov/authorities/names/n86854870
245 10 $aBounded arithmetic /$cSamuel R. Buss.
260 $aNapoli :$bBibliopolis,$c[1986], ©1986.
300 $a221 pages ;$c24 cm.
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
490 1 $aStudies in proof theory ;$v3
500 $aA reprint of the author's thesis (Ph. D.)--Princeton University, 1985. Cf. Acknowledgements.
504 $aBibliography: p. [215]-216.
500 $aIncludes indexes.
650 0 $aComputable functions.$0http://id.loc.gov/authorities/subjects/sh85029469
650 0 $aRecursive functions.$0http://id.loc.gov/authorities/subjects/sh85112014
650 0 $aLogic, Symbolic and mathematical.$0http://id.loc.gov/authorities/subjects/sh85078115
650 0 $aComputational complexity.$0http://id.loc.gov/authorities/subjects/sh85029473
650 0 $aDefinability theory (Mathematical logic)$0http://id.loc.gov/authorities/subjects/sh85036457
650 0 $aProof theory.$0http://id.loc.gov/authorities/subjects/sh85107437
830 0 $aStudies in proof theory ;$v3.$0http://id.loc.gov/authorities/names/n86749099
852 00 $bmat$hQA9.59$i.B87 1986g