NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.16 seconds)

Spelling suggestions: "subject:"seligman heorem"" "subject:"seligman atheorem""

1

A Formal Proof of Feit-Higman Theorem in Agda

Rao, 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.
Feit-Higman Theorem
Agda (Computer Program Langauge)
Polygons
Generalised Polygons
Type Theory
Lemma
Mathematics

Page generated in 0.3558 seconds