Book
Licensed
Unlicensed
Requires Authentication
Degrees of Unsolvability
-
Gerald E. Sacks
Language:
English
Published/Copyright:
1964
About this book
A classic treatment of degrees of unsolvability from the acclaimed Annals of Mathematics Studies series
Princeton University Press is proud to have published the Annals of Mathematics Studies since 1940. One of the oldest and most respected series in science publishing, it has included many of the most important and influential mathematical works of the twentieth century. The series continues this tradition as Princeton University Press publishes the major works of the twenty-first century.
To mark the continued success of the series, all books are available in paperback and as ebooks.
Topics
|
Publicly Available Download PDF |
i |
|
Requires Authentication Unlicensed Licensed Download PDF |
vii |
|
Publicly Available Download PDF |
ix |
|
Requires Authentication Unlicensed Licensed Download PDF |
1 |
|
Requires Authentication Unlicensed Licensed Download PDF |
7 |
|
Requires Authentication Unlicensed Licensed Download PDF |
21 |
|
Requires Authentication Unlicensed Licensed Download PDF |
43 |
|
Requires Authentication Unlicensed Licensed Download PDF |
55 |
|
Requires Authentication Unlicensed Licensed Download PDF |
77 |
|
Requires Authentication Unlicensed Licensed Download PDF |
117 |
|
Requires Authentication Unlicensed Licensed Download PDF |
123 |
|
Requires Authentication Unlicensed Licensed Download PDF |
135 |
|
Requires Authentication Unlicensed Licensed Download PDF |
153 |
|
Requires Authentication Unlicensed Licensed Download PDF |
163 |
|
Requires Authentication Unlicensed Licensed Download PDF |
169 |
|
Requires Authentication Unlicensed Licensed Download PDF |
173 |
Publishing information
Pages and Images/Illustrations in book
eBook published on:
March 2, 2016
eBook ISBN:
9781400881840
Pages and Images/Illustrations in book
Main content:
192
eBook ISBN:
9781400881840
Keywords for this book
Theorem; Existential quantification; Partially ordered set; Upper and lower bounds; Infimum and supremum; Null set; Partial function; Subset; Inequality (mathematics); Uncountable set; Countable set; Empty set; Natural number; Requirement; Cardinality; Continuum hypothesis; Recursively enumerable set; Limit point; Disjoint union; Zorn's lemma; Conjecture; Monotonic function; Open set; Aleph number; Contradiction; Axiom of choice; Recursive set; Gödel numbering; Metric space; Well-order; Baire category theorem; Set (mathematics); Equation; Reductio ad absurdum; Lebesgue measure; Fubini's theorem; Tychonoff's theorem; Limit of a sequence; Finite set; Existence theorem; Simultaneous equations; Without loss of generality; Fixed-point theorem; Corollary; Mutual exclusivity; Mean of a function; Transfinite induction; Approximation; Commutative property; Regular space; Addition; Cartesian product; Identity function; W0; Integer; Sequence; Variable (mathematics); Predicate (mathematical logic); Arithmetic function; Cardinality of the continuum; Enumeration; Category theory; Product measure; Product topology; Scientific notation; Real number; Arithmetical set; Topology; Measure (mathematics); Union (set theory)
Audience(s) for this book
College/higher education;Professional and scholarly;
