2000 character limit reached
On propositional logic semirings
Published 17 Jan 2024 in math.LO | (2401.09043v1)
Abstract: Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for deduction and proof grounded in atoms of propositional logic. The result is an algebraic approach to proving propositions in propositional logic. To illustrate the effectiveness and constraints of this method, we conclude with several specific examples.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.