A variant of a recursively unsolvable problem

Post, Emil L.

doi:10.1090/S0002-9904-1946-08555-9

Bulletin of the American Mathematical Society

The Bulletin publishes expository articles on contemporary mathematical research, written in a way that gives insight to mathematicians who may not be experts in the particular topic. The Bulletin also publishes reviews of selected books in mathematics and short articles in the Mathematical Perspectives section, both by invitation only.

ISSN 1088-9485 (online) ISSN 0273-0979 (print)

The 2020 MCQ for Bulletin of the American Mathematical Society is 0.84.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

A variant of a recursively unsolvable problem
HTML articles powered by AMS MathViewer

by Emil L. Post PDF

Bull. Amer. Math. Soc. 52 (1946), 264-268

References

Alonzo Church, An Unsolvable Problem of Elementary Number Theory, Amer. J. Math. 58 (1936), no. 2, 345–363. MR 1507159, DOI 10.2307/2371045
Wilfried Sieg, Step by recursive step: Church’s analysis of effective calculability, Bull. Symbolic Logic 3 (1997), no. 2, 154–180. MR 1465816, DOI 10.2307/421012
Emil L. Post, Formal reductions of the general combinatorial decision problem, Amer. J. Math. 65 (1943), 197–215. MR 7893, DOI 10.2307/2371809
Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316. MR 10514, DOI 10.1090/S0002-9904-1944-08111-1

Additional Information

Journal: Bull. Amer. Math. Soc. 52 (1946), 264-268
DOI: https://doi.org/10.1090/S0002-9904-1946-08555-9
MathSciNet review: 0015343