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

Back in 1952, Mostowski proved that PA proves the consistency of its finitely axiomatised sub-theories.

Any pointers to particularly nice later proofs of this lovely result? Or indeed particular nice presentations of the same basic proof idea? Thanks!

share|cite|improve this question
One technique is to show that we can define the truth of the formulas for finite level of arithmetic formulas containing that subset and then use induction on the truth predicate for them over the size of the proofs to show that the final formula in a proof is true. Obviously we also need to prove cut-elimination for proofs of that formulas in that finite level. – Kaveh Aug 3 '12 at 23:43

Your Answer


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

Browse other questions tagged or ask your own question.