{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/17276"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/17276","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets","abstract":"Using the the dependently-typed programming language Agda, we formalise orders, with attention to the theory of Galois Connections, and showcase it by formalising a few results of the category of algebraic contexts with relational homomorphisms presented by Jipsen (2012) and Moshier (2013). We aim to exhibit an internal theory of Galois Connections and Closure operators where the ambient space need not have a notion of meets (intersections), which are the usual medium in presenting antisymmetry of partial orders. Instead we consider `symmetric quotients' as being the relational counterpart of propositional calculus' primitive connective: equivalence. We argue that it as a more natural primitive than meet --- especially its connection with certain proof heuristics regarding posets. Moreover, not only do we constrain ourselves to an unconventional set of primitive operators, but in fact we discard the familiar setting of relations and sets in favour of the more general setting of ordered categories with converse (OCCs) --- in fact, a large portion does not require identities and so semigroupoids may be used instead.","abstract_html":"Using the the dependently-typed programming language Agda, we formalise orders, with attention to the theory of Galois Connections, and showcase it by formalising a few results of the category of algebraic contexts with relational homomorphisms presented by Jipsen (2012) and Moshier (2013). We aim to exhibit an internal theory of Galois Connections and Closure operators where the ambient space need not have a notion of meets (intersections), which are the usual medium in presenting antisymmetry of partial orders. Instead we consider `symmetric quotients&#x27; as being the relational counterpart of propositional calculus&#x27; primitive connective: equivalence. We argue that it as a more natural primitive than meet --- especially its connection with certain proof heuristics regarding posets. Moreover, not only do we constrain ourselves to an unconventional set of primitive operators, but in fact we discard the familiar setting of relations and sets in favour of the more general setting of ordered categories with converse (OCCs) --- in fact, a large portion does not require identities and so semigroupoids may be used instead.","abstract_has_math":false,"creators":["Al-hassy, Musa"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing and Software","school":null,"contributors":[],"advisors":["Kahl, Wolfram"],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-06","date_published":"2015-06","updated_at":"2026-11-18T19:36:54Z","subjects":["relation algebra, ordered category, converse, order, galois connection"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/17470"],"render_values":[{"text":"https://doi.org/10.71548/17470","href":"https://doi.org/10.71548/17470","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/17276","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/17276","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F17276","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Kahl, Wolfram"]},{"key":"dc:contributor.department","label":"Department","values":["Computing and Software"]},{"key":"dc:creator","label":"Author","values":["Al-hassy, Musa"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-05-08T18:24:24Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-05-08T18:24:24Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-06"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["relation algebra, ordered category, converse, order, galois connection"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/17276","https://doi.org/10.71548/17470"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Using the the dependently-typed programming language Agda, we formalise orders, with attention to the theory of Galois Connections, and showcase it by formalising a few results of the category of algebraic contexts with relational homomorphisms presented by Jipsen (2012) and Moshier (2013). We aim to exhibit an internal theory of Galois Connections and Closure operators where the ambient space need not have a notion of meets (intersections), which are the usual medium in presenting antisymmetry of partial orders. Instead we consider `symmetric quotients' as being the relational counterpart of propositional calculus' primitive connective: equivalence. We argue that it as a more natural primitive than meet --- especially its connection with certain proof heuristics regarding posets. Moreover, not only do we constrain ourselves to an unconventional set of primitive operators, but in fact we discard the familiar setting of relations and sets in favour of the more general setting of ordered categories with converse (OCCs) --- in fact, a large portion does not require identities and so semigroupoids may be used instead."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MSc)"]},{"key":"dc:title","label":"Title","values":["A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Kahl, Wolfram"],"dc:contributor.department":["Computing and Software"],"dc:creator":["Al-hassy, Musa"],"dc:date.accessioned":["2015-05-08T18:24:24Z"],"dc:date.available":["2015-05-08T18:24:24Z"],"dc:date.issued":["2015-06"],"dc:description.abstract":["Using the the dependently-typed programming language Agda, we formalise orders, with attention to the theory of Galois Connections, and showcase it by formalising a few results of the category of algebraic contexts with relational homomorphisms presented by Jipsen (2012) and Moshier (2013). We aim to exhibit an internal theory of Galois Connections and Closure operators where the ambient space need not have a notion of meets (intersections), which are the usual medium in presenting antisymmetry of partial orders. Instead we consider `symmetric quotients' as being the relational counterpart of propositional calculus' primitive connective: equivalence. We argue that it as a more natural primitive than meet --- especially its connection with certain proof heuristics regarding posets. Moreover, not only do we constrain ourselves to an unconventional set of primitive operators, but in fact we discard the familiar setting of relations and sets in favour of the more general setting of ordered categories with converse (OCCs) --- in fact, a large portion does not require identities and so semigroupoids may be used instead."],"dc:description.degree":["Master of Science (MSc)"],"dc:identifier.uri":["http://hdl.handle.net/11375/17276","https://doi.org/10.71548/17470"],"dc:language.iso":["en"],"dc:subject":["relation algebra, ordered category, converse, order, galois connection"],"dc:title":["A Mechanisation of Internal Galois Connections In Order Theory Formalised Without Meets"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:36:54Z"}