<?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-21T03:59:48Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/17276" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/17276</identifier><datestamp>2026-09-24T07:03:59Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Kahl, Wolfram</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Al-hassy, Musa</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-05-08T18:24:24Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-05-08T18:24:24Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-06</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/17276</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/17470</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Using the the dependently-typed programming language Agda,&#xd;
we formalise orders, with attention to the theory of Galois Connections,&#xd;
and showcase it by formalising a few results of the category of algebraic&#xd;
contexts with relational homomorphisms presented by Jipsen (2012) and Moshier (2013).&#xd;
&#xd;
We aim to exhibit an internal theory of Galois Connections and Closure operators&#xd;
where the ambient space need not have a notion of meets (intersections), which&#xd;
are the usual medium in presenting antisymmetry of partial orders.&#xd;
Instead we consider `symmetric quotients' as being the relational counterpart of&#xd;
propositional calculus' primitive connective: equivalence. We argue that it as a more&#xd;
natural primitive than meet --- especially its connection with certain proof heuristics&#xd;
regarding posets. Moreover, not only do we constrain ourselves to an unconventional&#xd;
set of primitive operators, but in fact we discard the familiar setting of relations&#xd;
and sets in favour of the more general setting of ordered categories with converse&#xd;
(OCCs) --- in fact, a large portion does not require identities and so semigroupoids&#xd;
may be used instead.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">relation algebra, ordered category, converse, order, galois connection</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>