{"id":{"repo_id":"cape-town","oai_identifier":"oai:open.uct.ac.za:11427/41004"},"canonical_url":"https://search.dev.ndltd.org/etd/cape-town/oai:open.uct.ac.za:11427/41004","repository":{"repo_id":"cape-town","name":"University of Cape Town","base_url":"https://open.uct.ac.za/oai/request"},"display":{"title":"Algebraic aspects of propositional logic","abstract":"In this dissertation, we seek to examine the connection between abstract algebra and propositional logic. We start by considering the category Bool of Boolean algebras, the algebraic counterpart of classical propositional logic. We provide an algebraic definition of theories and models of classical logic and provide algebraic algorithms to determine whether a chosen formula is a theorem of a given theory of classical logic. In order to generalize this approach, we then describe varieties of universal algebra and some of their properties. Using this framework, we show in a general setting how a formal theory of propositional logic induces a variety of universal algebra in which logical connectives become algebraic operations and logical formulae are considered equal when they are logically equivalent. We then discuss algebraic varieties corresponding to various non-classical propositional logics. In particular, we consider the variety of Heyting algebras Heyt which corresponds to intuitionistic logic, and certain subvarieties of Heyt which correspond to intermediate logics. We then describe several algebraic varieties which correspond to theories of normal modal logic. Moreover, by considering free algebras and completeness in Heyt, we establish that we are unable to use the same methods used in Bool to construct algorithms to determine theorems of intuitionistic logic. Lastly, we construct an adjunction between Heyt and the category of topological Boolean algebras, and through this show that we again cannot construct similar algebraic algorithms to determine theorems in the modal logic S4.","abstract_html":"In this dissertation, we seek to examine the connection between abstract algebra and propositional logic. We start by considering the category Bool of Boolean algebras, the algebraic counterpart of classical propositional logic. We provide an algebraic definition of theories and models of classical logic and provide algebraic algorithms to determine whether a chosen formula is a theorem of a given theory of classical logic. In order to generalize this approach, we then describe varieties of universal algebra and some of their properties. Using this framework, we show in a general setting how a formal theory of propositional logic induces a variety of universal algebra in which logical connectives become algebraic operations and logical formulae are considered equal when they are logically equivalent. We then discuss algebraic varieties corresponding to various non-classical propositional logics. In particular, we consider the variety of Heyting algebras Heyt which corresponds to intuitionistic logic, and certain subvarieties of Heyt which correspond to intermediate logics. We then describe several algebraic varieties which correspond to theories of normal modal logic. Moreover, by considering free algebras and completeness in Heyt, we establish that we are unable to use the same methods used in Bool to construct algorithms to determine theorems of intuitionistic logic. Lastly, we construct an adjunction between Heyt and the category of topological Boolean algebras, and through this show that we again cannot construct similar algebraic algorithms to determine theorems in the modal logic S4.","abstract_has_math":false,"creators":["Leisegang, Nicholas"],"institution":"Department of Mathematics and Applied Mathematics","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Janelidze-Gray, Tamar","Janelidze, George"],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024","date_published":"2024","updated_at":"2026-07-22T22:23:38Z","subjects":["Bool of Boolean algebras"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11427/41004","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Janelidze-Gray, Tamar","Janelidze, George"]},{"key":"dc:creator","label":"Author","values":["Leisegang, Nicholas"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-02-25T07:51:45Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2025-02-25T07:51:45Z"]},{"key":"dc:date.issued","label":"Date","values":["2024"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Applied Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Cape Town"]},{"key":"dc:type","label":"Dc Type","values":["Thesis / Dissertation"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["Masters","MSc"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bool of Boolean algebras"]}]},{"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/11427/41004"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this dissertation, we seek to examine the connection between abstract algebra and propositional logic. We start by considering the category Bool of Boolean algebras, the algebraic counterpart of classical propositional logic. We provide an algebraic definition of theories and models of classical logic and provide algebraic algorithms to determine whether a chosen formula is a theorem of a given theory of classical logic. In order to generalize this approach, we then describe varieties of universal algebra and some of their properties. Using this framework, we show in a general setting how a formal theory of propositional logic induces a variety of universal algebra in which logical connectives become algebraic operations and logical formulae are considered equal when they are logically equivalent. We then discuss algebraic varieties corresponding to various non-classical propositional logics. In particular, we consider the variety of Heyting algebras Heyt which corresponds to intuitionistic logic, and certain subvarieties of Heyt which correspond to intermediate logics. We then describe several algebraic varieties which correspond to theories of normal modal logic. Moreover, by considering free algebras and completeness in Heyt, we establish that we are unable to use the same methods used in Bool to construct algorithms to determine theorems of intuitionistic logic. Lastly, we construct an adjunction between Heyt and the category of topological Boolean algebras, and through this show that we again cannot construct similar algebraic algorithms to determine theorems in the modal logic S4."]},{"key":"dc:title","label":"Title","values":["Algebraic aspects of propositional logic"]}]}],"canonical_facts":{"dc:contributor.advisor":["Janelidze-Gray, Tamar","Janelidze, George"],"dc:creator":["Leisegang, Nicholas"],"dc:date.accessioned":["2025-02-25T07:51:45Z"],"dc:date.available":["2025-02-25T07:51:45Z"],"dc:date.issued":["2024"],"dc:description.abstract":["In this dissertation, we seek to examine the connection between abstract algebra and propositional logic. We start by considering the category Bool of Boolean algebras, the algebraic counterpart of classical propositional logic. We provide an algebraic definition of theories and models of classical logic and provide algebraic algorithms to determine whether a chosen formula is a theorem of a given theory of classical logic. In order to generalize this approach, we then describe varieties of universal algebra and some of their properties. Using this framework, we show in a general setting how a formal theory of propositional logic induces a variety of universal algebra in which logical connectives become algebraic operations and logical formulae are considered equal when they are logically equivalent. We then discuss algebraic varieties corresponding to various non-classical propositional logics. In particular, we consider the variety of Heyting algebras Heyt which corresponds to intuitionistic logic, and certain subvarieties of Heyt which correspond to intermediate logics. We then describe several algebraic varieties which correspond to theories of normal modal logic. Moreover, by considering free algebras and completeness in Heyt, we establish that we are unable to use the same methods used in Bool to construct algorithms to determine theorems of intuitionistic logic. Lastly, we construct an adjunction between Heyt and the category of topological Boolean algebras, and through this show that we again cannot construct similar algebraic algorithms to determine theorems in the modal logic S4."],"dc:identifier.uri":["http://hdl.handle.net/11427/41004"],"dc:language.iso":["en"],"dc:publisher.department":["Department of Mathematics and Applied Mathematics"],"dc:publisher.institution":["University of Cape Town"],"dc:subject":["Bool of Boolean algebras"],"dc:title":["Algebraic aspects of propositional logic"],"dc:type":["Thesis / Dissertation"],"dc:type.qualificationlevel":["Masters","MSc"]},"updated_at":"2026-07-22T22:23:38Z"}