• English
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Log In
  • Communities & Collections
  • Browse OpenUCT
  • English
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Log In
  1. Home
  2. Browse by Subject

Browsing by Subject "Bool of Boolean algebras"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    Open Access
    Algebraic aspects of propositional logic
    (2024) Leisegang, Nicholas; Janelidze-Gray, Tamar; Janelidze, George
    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.
UCT Libraries logo

Contact us

Jill Claassen

Manager: Scholarly Communication & Publishing

Email: openuct@uct.ac.za

+27 (0)21 650 1263

  • Open Access @ UCT

    • OpenUCT LibGuide
    • Open Access Policy
    • Open Scholarship at UCT
    • OpenUCT FAQs
  • UCT Publishing Platforms

    • UCT Open Access Journals
    • UCT Open Access Monographs
    • UCT Press Open Access Books
    • Zivahub - Open Data UCT
  • Site Usage

    • Cookie settings
    • Privacy policy
    • End User Agreement
    • Send Feedback

DSpace software copyright © 2002-2025 LYRASIS