| Frege (1879) / 1： |
| Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought |
| Peano (1889) / 2： |
| The principles of arithmetic, presented by a new method |
| Dedekind (1890a) / 3： |
| Letter to Keferstein Burali-Forti (1897 and 1897a) |
| A question on transfinite numbers and On well-ordered classes |
| Cantor (1899) / 4： |
| Letter to Dedekind |
| Padoa (1900) / 5： |
| Logical introduction to any deductive theory |
| Russell (1902) / 6： |
| Letter to Frege |
| Frege (1902) / 7： |
| Letter to Russell |
| Hilbert (1904) / 8： |
| On the foundations of logic and arithmetic |
| Zermelo (1904) / 9： |
| Proof that every set can be well-ordered |
| Richard (1905) / 10： |
| The principles of mathematics and the problem of sets |
| Kouml;nig (1905a) / 11： |
| On the foundations of set theory and the continuum problem |
| Russell (1908a) / 12： |
| Mathematical logic as based on the theory of types |
| Zermelo (1908) / 13： |
| A new proof of the possibility of a well-ordering |
| Zermelo (l908a) / 14： |
| Investigations in the foundations of set theory I Whitehead and Russell (1910) |
| Incomplete symbols: Descriptions |
| Wiener (1914) / 15： |
| A simplification of the logic of relations |
| Louml;wenheim (1915) / 16： |
| On possibilities in the calculus of relatives |
| Skolem (1920) / 17： |
| Logico-combinatorial investigations in the satisfiability or provability of mathematical propositions: A simplified proof of a theorem by L |
| Louml;wenheim and generalizations of the |
| theorem / 18： |
| Post (1921) / 19： |
| Introduction to a general theory of elementary propositions |
| Fraenkel (1922b) / 20： |
| The notion "definite" and the independence of the axiom of choice |
| Skolem (1922) / 21： |
| Some remarks on axiomatized set theory |
| Skolem (1923) / 22： |
| The foundations of elementary arithmetic established by means of the recursive mode of thought, without the use of apparent variables ranging over infinite domains |
| Brouwer (1923b, 1954, and 1954a) / 23： |
| On the significance of the principle of excluded middle in mathematics, especially in function theory, Addenda and corrigenda, and Further addenda and corrigenda von Neumann (1923) |
| On the introduction of transfinite numbers Schouml;nfinkel (1924) |
| On the building blocks of mathematical logic filbert (1925) |
| On the infinite von Neumann (1925) |
| An axiomatization of set theory Kolmogorov (1925) |
| On the principle of excluded middle Finsler (1926) |
| Formal proofs and undecidability Brouwer (1927) |
| On the domains of definition of functions filbert (1927) |
| The foundations of mathematics Weyl (1927) |
| Comments on Hilbert's second lecture on the foundations of mathematics Bernays (1927) |
| Appendix to Hilbert's lecture "The foundations of mathematics" Brouwer (1927a) |
| Intuitionistic reflections on formalism Ackermann (1928) |
| On filbert's construction of the real numbers Skolem (1928) |
| On mathematical logic Herbrand (1930) |
| Investigations in proof theory: The properties of true propositions Gouml;del (l930a) |
| The completeness of the axioms of the functional calculus of logic Gouml;del (1930b, 1931, and l931a) |
| Some metamathematical results on completeness and consistency, On formally undecidable propositions of Principia mathematica and related systems I, and On completeness and consistencyHerbrand (1931b) |
| On the consistency of arithmetic |
| References |
| Index |
| Frege (1879) / 1： |
| Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought |
| Peano (1889) / 2： |
図書
