Some proofs of undecidability of arithmetic
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
M. Artigue, E. Isambert, M. Perrin, A. Zalc (1978)
Fundamenta Mathematicae
Similarity:
Brahmagupta
Similarity:
Augustus DeMorgan
Similarity:
John Leslie
Similarity:
Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas (2010)
Acta Arithmetica
Similarity:
(2009)
Acta Arithmetica
Similarity:
Yahya Ould Hamidoune, Alain Plagne (2002)
Acta Arithmetica
Similarity:
Yong-Gao Chen (2005)
Acta Arithmetica
Similarity:
Abercrombie Alex G., Banks William D., Shparlinski Igor E. (2009)
Acta Arithmetica
Similarity:
Aleksandar Ignjatović (1985)
Publications de l'Institut Mathématique
Similarity:
Tomasz Schoen (2011)
Acta Arithmetica
Similarity:
Javier Docampo Rey (2009)
Revue d'histoire des mathématiques
Similarity:
This paper contains a critical edition of a short commercial arithmetic written in Castilian (ca. 1400). The manuscript has certain characteristic features, like the presence of composite fractions, that distinguishes it from other known treatises of the Iberian peninsula. The document appears to improve considerably our knowledge of the origins and the transmission of vernacular commercial arithmetic in Europe.
Qing-Zhong Ji (2011)
Acta Arithmetica
Similarity:
Régis de la Bretèche, Kevin Ford, Joseph Vandehey (2013)
Acta Arithmetica
Similarity:
We improve known bounds for the maximum number of pairwise disjoint arithmetic progressions using distinct moduli less than x. We close the gap between upper and lower bounds even further under the assumption of a conjecture from combinatorics about Δ-systems (also known as sunflowers).