An Analytical Approach to Higman's Lemma
Date
2024
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Producer
Director
Performer
Choreographer
Costume Designer
Music
Videographer
Lighting Designer
Set Designer
Crew Member
Funder
Rehearsal Director
Concert Coordinator
Advisor
Moderator
Panelist
Alternative Title
Department
Haverford College. Department of Computer Science
Type
Thesis
Original Format
Running Time
File Format
Place of Publication
Date Span
Copyright Date
Award
Language
eng
Note
Table of Contents
Terms of Use
Rights Holder
Access Restrictions
Tri-College users only
Terms of Use
Tripod URL
Identifier
Abstract
Higman’s lemma is a fundamental result in computer science and mathematics, providing applications in areas such as graph theory, and other data structures. One proof of this lemma provides an interesting use of the minimally bad sequence proof technique, originated by Nash Williams. Furthermore, this lemma sets the foundation for the finite basis property, a property focused on the potential definable nature of infinite sets. However, it is not commonly known to look at this lemma analytically rather than algebraically. By taking an analytical approach to Higman’s lemma through topological and analytical notions, new perspectives and insights may be uncovered, shedding light on other possible applications of this lemma.