An Unsolvable Problem of Elementary Number Theory

1936 ◽  
Vol 58 (2) ◽  
pp. 345 ◽  
Author(s):  
Alonzo Church
Keyword(s):  
Number Theory ◽  
Elementary Number Theory ◽  
Unsolvable Problem ◽  
Elementary Number

Martin Davis. On formally undecidable propositions of the Principia Mathematica and related systems. I. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, p. 4. - Kurt Gödel. On formally undecidable propositions of Principia Mathematica and related systems I. English translation of 4183 by Elliott Mendelson. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 5–38. - Martin Davis. On undecidable propositions of formal mathematical systems. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 39–40. - Kurt Gödel. On undecidable propositions of formal mathematical systems. A revised reprint of 41814. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 41–71. (See corrigenda, p. 74.) - Kurt Gödel. Postscriptum. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 71–73. - Kurt Gödel. On intuitionistic arithmetic and number theory. English translation of 41811 by Martin Davis. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 75–81. - Kurt Gödel. On the length of proofs. English translation of I 116 by Martin Davis. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 82–83. - Kurt Gödel. Remarks before the Princeton Bicentennial Conference on Problems in Mathematics — 1946. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 84–88. [Cf. XII 89(2).] - Martin Davis. An unsolvable problem of elementary number theory. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, p. 88. - Alonzo Church. An unsolvable problem of elementary number theory. A reprint of I 73. The undecidable, Basic papers on undecidable propositions, unsolvable problems and computable functions, edited by Martin Davis, Raven Press, Hewlett, New York, 1965, pp. 89–107.

1966 ◽  
Vol 31 (3) ◽  
pp. 484-494
Author(s):  
Stefan Bauer-Mengelberg
Keyword(s):  
New York ◽  
Number Theory ◽  
English Translation ◽  
Elementary Number Theory ◽  
Unsolvable Problem ◽  
Elementary Number ◽  
Kurt Gödel ◽  
Computable Functions ◽  
Martin Davis ◽  
Unsolvable Problems

Elementary Number Theory

2016 ◽  
pp. 1-32
Author(s):  
Gary L. Mullen ◽  
James A. Sellers
Keyword(s):  
Number Theory ◽  
Elementary Number Theory ◽  
Elementary Number

Some Elementary Number Theory

2019 ◽  
pp. 239-244
Author(s):  
Richard Evan Schwartz
Keyword(s):  
Number Theory ◽  
Elementary Number Theory ◽  
Result Section ◽  
Structural Result ◽  
Elementary Number

This chapter proves some number-theoretic results about the sequences defined in Chapter 23. It proceeds as follows. Section 24.2 proves Lemma 24.1, a multipart structural result. Section 24.3 takes care of several number-theoretic details left over from Section 23.6 and Section 23.7.

Infinite Orbits Revisited

2019 ◽  
pp. 227-238
Author(s):  
Richard Evan Schwartz
Keyword(s):  
Number Theory ◽  
Elementary Number Theory ◽  
Elementary Number ◽  
Model Section

This is the first of four chapters giving a self-contained proof of Theorem 0.7. Section 23.2 describes a sequence of even rationals {pn/qn} that converges to A. Section 23.3 states the two main technical results, the Box Theorem and the Copy Theorem. Section 23.4 shows how to choose a sequence {cn}. Section 23.5 states three auxiliary results about arc copying in the plaid model. Section 23.6 deduces the Box Theorem from one of these auxiliary lemmas. Section 23.7 deduces the Copy Theorem from the auxiliary lemmas and some elementary number theory. Thus, after this chapter ends, the only remaining task is to prove the auxiliary copy lemmas and prove a few lemmas in elementary number theory.

Sign in / Sign up

Export Citation Format

Share Document