Mathematician’s World
暂无分享,去创建一个
[1] Giuseppe Peano,et al. Arithmetices Principia Novo Methodo Exposita , 1889 .
[2] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .
[3] A. Fraenkel. Untersuchungen über die Grundlagen der Mengenlehre , 1925 .
[4] R. Dedekind,et al. Was sind und was sollen die Zahlen? / von Richard Dedekind , 1888 .
[5] Gordon S. Novak,et al. Artificial Intelligence Project , 1990 .
[6] Atle Selberg. An Elementary Proof of the Prime-Number Theorem , 1949 .
[7] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.
[8] J. McCarthy. A Tough Nut for Proof Procedures , 1964 .
[9] Heinz-Dieter Ebbinghaus,et al. Ernst Zermelo - an approach to his life and work , 2007 .
[10] Terence Tao,et al. Every odd number greater than 1 is the sum of at most five primes , 2012, Math. Comput..
[11] Michael Alekhnovich,et al. Mutilated chessboard problem is exponentially hard for resolution , 2004, Theor. Comput. Sci..
[12] T. Hales. The Kepler conjecture , 1998, math/9811078.
[13] G. Szekeres,et al. A combinatorial problem in geometry , 2009 .
[14] David Hilbert,et al. Grundlagen der Geometrie , 2022 .
[15] E. Zermelo. Untersuchungen über die Grundlagen der Mengenlehre. I , 1908 .
[16] D. Ulig. On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements , 1974 .
[17] A. Odlyzko,et al. Disproof of the Mertens conjecture. , 1984 .
[18] I. Vinogradov,et al. Representation of an odd number as the sum of three primes , 1937 .
[19] Robert L. Vaught,et al. Axiomatizability by a schema , 1968, Journal of Symbolic Logic.
[20] Bertrand Russell,et al. The Autobiography of Bertrand Russell , 1950 .
[21] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .
[22] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[23] Vojtech Rödl,et al. Boolean Circuits, Tensor Ranks, and Communication Complexity , 1997, SIAM J. Comput..
[24] P. Erdös,et al. On a New Method in Elementary Number Theory Which Leads to An Elementary Proof of the Prime Number Theorem. , 1949, Proceedings of the National Academy of Sciences of the United States of America.