Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
Please make all selections above before adding to cart
Nine Papers on Logic and Quantum Electrodynamics
| eBook ISBN: | 978-1-4704-3234-8 |
| Product Code: | TRANS2/23.E |
| List Price: | $165.00 |
| MAA Member Price: | $148.50 |
| AMS Member Price: | $132.00 |
Click above image for expanded view
Nine Papers on Logic and Quantum Electrodynamics
| eBook ISBN: | 978-1-4704-3234-8 |
| Product Code: | TRANS2/23.E |
| List Price: | $165.00 |
| MAA Member Price: | $148.50 |
| AMS Member Price: | $132.00 |
-
Book DetailsAmerican Mathematical Society Translations - Series 2Volume: 23; 1963; 335 ppMSC: Primary 03
-
Table of Contents
-
Articles
-
B. A. Trahtenbrot — Impossibility of an algorithm for the decision problem in finite classes
-
A. A. Mučnik — Isomorphism of systems of recursively enumerable sets with effective properties
-
V. K. Detlovs — The equivalence of normal algorithms and recursive functions
-
A. S. Esenin-Vol′pin — Unprovability of Souslin’s hypothesis without the aid of the axiom of choice in the Bernays-Mostowski axiom system
-
V. A. Uspenskiĭ — Some remarks on recursively enumerable sets
-
V. A. Uspenskiĭ — Gödel’s theorem and the theory of algorithms
-
N. A. Šanin — On the constructive interpretation of mathematical judgments
-
I. N. Hlodovskiĭ — A new proof of the consistency of arithmetic
-
P. K. Raševskiĭ — On the mathematical foundations of quantum electrodynamics
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
-
Articles
-
B. A. Trahtenbrot — Impossibility of an algorithm for the decision problem in finite classes
-
A. A. Mučnik — Isomorphism of systems of recursively enumerable sets with effective properties
-
V. K. Detlovs — The equivalence of normal algorithms and recursive functions
-
A. S. Esenin-Vol′pin — Unprovability of Souslin’s hypothesis without the aid of the axiom of choice in the Bernays-Mostowski axiom system
-
V. A. Uspenskiĭ — Some remarks on recursively enumerable sets
-
V. A. Uspenskiĭ — Gödel’s theorem and the theory of algorithms
-
N. A. Šanin — On the constructive interpretation of mathematical judgments
-
I. N. Hlodovskiĭ — A new proof of the consistency of arithmetic
-
P. K. Raševskiĭ — On the mathematical foundations of quantum electrodynamics
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.