Spelling suggestions: "subject:"ägda (eomputer 6program langauge)"" "subject:"ägda (eomputer 6program raingauge)""
1 |
A Formal Proof of Feit-Higman Theorem in AgdaRao, Balaji R January 2014 (has links) (PDF)
In this thesis we present a formalization of the combinatorial part of the proof of Feit-Higman theorem on generalized polygons. Generalised polygons are abstract geometric structures that generalize ordinary polygons and projective planes. They are closely related to finite groups.
The formalization is carried out in Agda, a dependently typed functional programming language and proof assistant based on the intuitionist type theory by Per Martin-Löf.
|
Page generated in 0.0586 seconds