Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What is the most basic set of axioms that one can use in proofs? As in, the axioms are irreducible. The most basic set of irrefutable rules in mathematics. I assume it has something to do with number theory, but what are they?

share|cite|improve this question
I am not a number theorist, but I would suggest the Peano Axioms. – AmagicalFishy Feb 27 '14 at 5:23
up vote 0 down vote accepted

The axiomatic method essentially starts with a set of axioms (not further analyzed), and develops their consecuences. I.e., there are the group axioms, from which a rich theory is developed. There is a (totally separate) axiomatization of (Euclidean) geometry,Peano's axiomatization of arithmetic, and even Blum's axioms for algorithmic complexity. There aren't "fundamental axioms for all mathematics" in the sense Euclid envisioned. The axiomatic idea spilled over into other areas, you can take Newton's laws as axioms for (classical) mechanics, the laws of thermodinamics are axioms for that area of physics.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.