2000 character limit reached
A Locale for Minimal Bad Sequences
Published 7 Aug 2012 in cs.LO | (1208.1366v1)
Abstract: We present a locale that abstracts over the necessary ingredients for constructing a minimal bad sequence, as required in classical proofs of Higman's lemma and Kruskal's tree theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
