<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T18:37:06Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9648" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9648</identifier><datestamp>2017-08-18T14:36:00Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="524c9bc9-921d-43f4-b6ae-a6079d78e721" confidence="600">Hunt, Alexis</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-09-08T13:29:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-09-08T13:29:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-09-08</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9648</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The field of graph structure theory was given life by the Graph Minors Project of Robertson and Seymour, which developed many tools for understanding the way graphs relate to each other and culminated in the proof of the Graph Minors Theorem. One area of ongoing research in the field is attempting to strengthen the Graph Minors Theorem to sets of graphs, and sets of sets of graphs, and so on.&#xd;
At the same time, there is growing interest in the applications of logic and formal languages to graph theory, and a significant amount of work in this field has recently been consolidated in the publication of a book by Courcelle and Engelfriet.&#xd;
We investigate the potential applications of logic and formal languages to the field of graph structure theory, suggesting a new area of research which may provide fruitful.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph structure</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">logic</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">formal languages</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">language theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">monadic second-order logic</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tree-decompositions</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">hyperedge replacement</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">HR algebra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">well-quasi-ordering</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cone graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cone ideal</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tree-generator</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">obstruction-width</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Establishing a Connection Between Graph Structure, Logic, and Language Theory</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>