A Formal Proof of Sylow‘s Theorem

  • Authors:

  • Florian Kammüller;Lawrence C. Paulson

  • Affiliations:

  • Computer Laboratory, University of Cambridge, UK;Computer Laboratory, University of Cambridge, UK

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Four statements equivalent to well-foundedness (well-founded induction, existence of recursively defined functions, uniqueness of recursively defined functions, and absence of descending ω-chains) have been proved in Mizar and the proofs mechanically ...