Some proofs of undecidability of arithmetic
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Andrzej Grzegorczyk (1956)
Fundamenta Mathematicae
Similarity:
Brahmagupta
Similarity:
Augustus DeMorgan
Similarity:
(2009)
Acta Arithmetica
Similarity:
Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas (2010)
Acta Arithmetica
Similarity:
John Leslie
Similarity:
Yahya Ould Hamidoune, Alain Plagne (2002)
Acta Arithmetica
Similarity:
M. Artigue, E. Isambert, M. Perrin, A. Zalc (1978)
Fundamenta Mathematicae
Similarity:
Yong-Gao Chen (2005)
Acta Arithmetica
Similarity:
Antonio Montalbán, Richard A. Shore (2016)
Fundamenta Mathematicae
Similarity:
We investigate the reverse mathematical strength of Turing determinacy up to Σ₅⁰, which is itself not provable in second order arithmetic.
Abercrombie Alex G., Banks William D., Shparlinski Igor E. (2009)
Acta Arithmetica
Similarity:
Tomasz Schoen (2011)
Acta Arithmetica
Similarity:
Ernest S. Croot III (2003)
Acta Arithmetica
Similarity:
Qing-Zhong Ji (2011)
Acta Arithmetica
Similarity:
Hédi Daboussi, András Sárközy (2003)
Acta Arithmetica
Similarity:
Bin Feng (2019)
Czechoslovak Mathematical Journal
Similarity:
We find, via the Selberg-Delange method, an asymptotic formula for the mean of arithmetic functions on certain APs. It generalizes a result due to Cui and Wu (2014).