ICAR Research Data Repository for Knowledge Management
A Formal Proof of Feit-Higman Theorem in Agda
Electronic Theses of Indian Institute of Science
View Archive Info| Field | Value | |
| Title |
A Formal Proof of Feit-Higman Theorem in Agda
|
|
| Creator |
Rao, Balaji R
|
|
| Subject |
Feit-Higman Theorem
Agda (Computer Program Langauge) Polygons Generalised Polygons Type Theory Lemma Mathematics |
|
| Description |
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. |
|
| Contributor |
Seshadri, Harish
|
|
| Date |
2018-02-17T20:21:25Z
2018-02-17T20:21:25Z 2018-02-18 2014 |
|
| Type |
Thesis
|
|
| Identifier |
http://hdl.handle.net/2005/3128
http://etd.ncsi.iisc.ernet.in/abstracts/3987/G26337-Abs.pdf |
|
| Language |
en_US
|
|
| Relation |
G26337
|
|