Enhanced Learning Of Boolean Reduction Using Set Theory | Zendy

John Hackworth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Enhanced Learning Of Boolean Reduction Using Set Theory

Author(s) -

John Hackworth

Publication year - 2020

Publication title -

papers on engineering education repository (american society for engineering education)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.18260/1-2--10126

Subject(s) - boolean algebra , free boolean algebra , boolean expression , complete boolean algebra , two element boolean algebra , computer science , reduction (mathematics) , boolean algebras canonically defined , set (abstract data type) , boolean function , boolean circuit , stone's representation theorem for boolean algebras , set theory , dominion , theoretical computer science , algebra over a field , mathematics , programming language , algorithm , pure mathematics , filtered algebra , geometry , law , political science

Although most students are taught set theory at a very early age, no texts covering Boolean algebra utilize this knowledge to enhance students’ abilities to grasp the concepts of the reduction of Boolean algebraic expressions at the college or university level. This paper explains the one-to-one relationship between Boolean algebra and set theory, and how the students’ prior acquired knowledge of set theory can be leveraged in the classroom as an instructional tool to better teach the reduction of Boolean algebraic expressions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research