LEADER 04805nam  22014175  450 
001 9910154752603321
005 20190708092533.0
010   $a1-4008-8184-6
024 7 $a10.1515/9781400881840
035   $a(CKB)3710000000620144
035   $a(MiAaPQ)EBC4738596
035   $a(DE-B1597)467994
035   $a(OCoLC)979579085
035   $a(DE-B1597)9781400881840
035   $a(EXLCZ)993710000000620144
100   $a20190708d2016      fg              
101 0 $aeng
135   $aurcnu||||||||
181   $2rdacontent
182   $2rdamedia
183   $2rdacarrier
200 10$aDegrees of Unsolvability. (AM-55), Volume 55 /$fGerald E. Sacks
205   $aSecond edition.
210  1$aPrinceton, NJ : $cPrinceton University Press, $d[2016]
210  4$d©1964
215   $a1 online resource (189 pages)
225 0 $aAnnals of Mathematics Studies ;$v248
311   $a0-691-07941-2 
320   $aIncludes bibliographical references.
327   $tFrontmatter -- $tPreface to revised edition -- $tContents -- $t§1. Preliminaries -- $t§2 . A Continuum of Mutually Incomparable Degrees -- $t§3. Uncountable Suborderings of Degrees -- $t§4. The Priority Method Of Friedberg and Muchnik -- $t§5. An Existence Theorem For Recursively Enumerable Degrees -- $t§6 . The Jump Operator -- $t§7. An Interpolation Theorem for Recursively Enumerable Degrees -- $t§8. Minimal Upper Bounds for Sequences of Degrees -- $t§9. Minimal Degrees -- $t§10. Measure-Theoretic, Category and Descriptive Set-Theoretic Arguments -- $t§11. Initial Segments of Degrees -- $t§12. Further Results and Conjectures -- $tBibliography
330   $aThe description for this book, Degrees of Unsolvability. (AM-55), Volume 55, will be forthcoming.
410  0$aAnnals of mathematics studies ;$vNumber 55.
606   $aRecursive functions
606   $aUnsolvability (Mathematical logic)
610   $aAddition.
610   $aAleph number.
610   $aAlgebraic topology.
610   $aApproximation.
610   $aArithmetic function.
610   $aArithmetical set.
610   $aAxiom of choice.
610   $aBaire category theorem.
610   $aCardinality of the continuum.
610   $aCardinality.
610   $aCartesian product.
610   $aCategory theory.
610   $aCommutative property.
610   $aConjecture.
610   $aContinuum hypothesis.
610   $aContradiction.
610   $aCorollary.
610   $aCountable set.
610   $aDisjoint union.
610   $aEffective method.
610   $aEmpty set.
610   $aEnumeration.
610   $aEquation.
610   $aExistence theorem.
610   $aExistential quantification.
610   $aFinite set.
610   $aFixed-point theorem.
610   $aFourier analysis.
610   $aFubini's theorem.
610   $aGödel numbering.
610   $aIdentity function.
610   $aInequality (mathematics).
610   $aInfimum and supremum.
610   $aInteger.
610   $aLebesgue measure.
610   $aLimit of a sequence.
610   $aLimit point.
610   $aMathematical induction.
610   $aMathematics.
610   $aMean of a function.
610   $aMeasure (mathematics).
610   $aMetric space.
610   $aMonotonic function.
610   $aMostowski.
610   $aMutual exclusivity.
610   $aNatural number.
610   $aNull set.
610   $aOpen set.
610   $aPartial function.
610   $aPartially ordered set.
610   $aPredicate (mathematical logic).
610   $aProduct measure.
610   $aProduct topology.
610   $aReal number.
610   $aRecursion.
610   $aRecursive set.
610   $aRecursively enumerable set.
610   $aReductio ad absurdum.
610   $aRegular space.
610   $aRequirement.
610   $aScientific notation.
610   $aSequence.
610   $aSet (mathematics).
610   $aSimultaneous equations.
610   $aSubset.
610   $aTheorem.
610   $aTopology.
610   $aTransfinite induction.
610   $aTychonoff's theorem.
610   $aUncountable set.
610   $aUnion (set theory).
610   $aUpper and lower bounds.
610   $aVariable (mathematics).
610   $aW0.
610   $aWell-order.
610   $aWithout loss of generality.
610   $aZorn's lemma.
615  0$aRecursive functions.
615  0$aUnsolvability (Mathematical logic)
676   $a517.5
700   $aSacks$b Gerald E., $050334
801  0$bDE-B1597
801  1$bDE-B1597
906   $aBOOK
912   $a9910154752603321
996   $aDegrees of Unsolvability. (AM-55), Volume 55$92787591
997   $aUNINA