{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-7842"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-7842","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"An Investigation of the Range of a Boolean Function","abstract":"The purpose of this section is to define a boolean algebra and to determine some of the important properties of it. A boolean algebra is a set B with two binary operations, join and meet, denoted by + and juxtaposition respectively, and a unary operation, complementation, denoted by ', which satisfy the following axioms: (1) for all a,b ∑ B (that is, for all a,b elements of B) a + b = b + a and a b = b a, (the commutative laws), (2) for all a,b,c ∑ B, a + b c =(a + b) (a + b) and a (b + c) = a b + a c, (the distributive laws), (3) there exists 0 ∑ B such that for each a ∑ B, a + 0 = a, and there exists 1 ∑ B such that for each a ∑ B, a 1 = a, (4) for each a ∑ B, a + a' = 1 and a a' = 0. If a + e = a for all a in B then 0 = 0 + e = e + 0 = e, so that there is exactly one element in B which satisfies the first half of axiom 3, namely 0. Similarly there is exactly one element in B which satisfies the second half of axiom 3, namely 1. The 0 and 1 as defined above will be called the distinguished elements.","abstract_html":"The purpose of this section is to define a boolean algebra and to determine some of the important properties of it. A boolean algebra is a set B with two binary operations, join and meet, denoted by + and juxtaposition respectively, and a unary operation, complementation, denoted by &#x27;, which satisfy the following axioms: (1) for all a,b ∑ B (that is, for all a,b elements of B) a + b = b + a and a b = b a, (the commutative laws), (2) for all a,b,c ∑ B, a + b c =(a + b) (a + b) and a (b + c) = a b + a c, (the distributive laws), (3) there exists 0 ∑ B such that for each a ∑ B, a + 0 = a, and there exists 1 ∑ B such that for each a ∑ B, a 1 = a, (4) for each a ∑ B, a + a&#x27; = 1 and a a&#x27; = 0. If a + e = a for all a in B then 0 = 0 + e = e + 0 = e, so that there is exactly one element in B which satisfies the first half of axiom 3, namely 0. Similarly there is exactly one element in B which satisfies the second half of axiom 3, namely 1. The 0 and 1 as defined above will be called the distinguished elements.","abstract_has_math":false,"creators":["Eggert, Jr., Norman H."],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Charles H. Cunkle"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:50:15Z","subjects":["Boolean","boolean algebra","functions","Algebra","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/5f5f-ed90"],"render_values":[{"text":"https://doi.org/10.26076/5f5f-ed90","href":"https://doi.org/10.26076/5f5f-ed90","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/6772","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/6772","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-7842","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Charles H. Cunkle"]},{"key":"dc:creator","label":"Author","values":["Eggert, Jr., Norman H."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["1900-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1963-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Boolean","boolean algebra","functions","Algebra","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/6772"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/5f5f-ed90"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The purpose of this section is to define a boolean algebra and to determine some of the important properties of it. A boolean algebra is a set B with two binary operations, join and meet, denoted by + and juxtaposition respectively, and a unary operation, complementation, denoted by ', which satisfy the following axioms: (1) for all a,b ∑ B (that is, for all a,b elements of B) a + b = b + a and a b = b a, (the commutative laws), (2) for all a,b,c ∑ B, a + b c =(a + b) (a + b) and a (b + c) = a b + a c, (the distributive laws), (3) there exists 0 ∑ B such that for each a ∑ B, a + 0 = a, and there exists 1 ∑ B such that for each a ∑ B, a 1 = a, (4) for each a ∑ B, a + a' = 1 and a a' = 0. If a + e = a for all a in B then 0 = 0 + e = e + 0 = e, so that there is exactly one element in B which satisfies the first half of axiom 3, namely 0. Similarly there is exactly one element in B which satisfies the second half of axiom 3, namely 1. The 0 and 1 as defined above will be called the distinguished elements."]},{"key":"dc:title","label":"Title","values":["An Investigation of the Range of a Boolean Function"]}]}],"canonical_facts":{"dc:contributor":["Charles H. Cunkle"],"dc:creator":["Eggert, Jr., Norman H."],"dc:date.available":["1900-01-01T08:00:00Z"],"dc:date.created":["1963-05-01T07:00:00Z"],"dc:description.abstract":["The purpose of this section is to define a boolean algebra and to determine some of the important properties of it. A boolean algebra is a set B with two binary operations, join and meet, denoted by + and juxtaposition respectively, and a unary operation, complementation, denoted by ', which satisfy the following axioms: (1) for all a,b ∑ B (that is, for all a,b elements of B) a + b = b + a and a b = b a, (the commutative laws), (2) for all a,b,c ∑ B, a + b c =(a + b) (a + b) and a (b + c) = a b + a c, (the distributive laws), (3) there exists 0 ∑ B such that for each a ∑ B, a + 0 = a, and there exists 1 ∑ B such that for each a ∑ B, a 1 = a, (4) for each a ∑ B, a + a' = 1 and a a' = 0. If a + e = a for all a in B then 0 = 0 + e = e + 0 = e, so that there is exactly one element in B which satisfies the first half of axiom 3, namely 0. Similarly there is exactly one element in B which satisfies the second half of axiom 3, namely 1. The 0 and 1 as defined above will be called the distinguished elements."],"dc:identifier":["https://digitalcommons.usu.edu/etd/6772"],"dc:identifier.doi":["https://doi.org/10.26076/5f5f-ed90"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["Boolean","boolean algebra","functions","Algebra","Mathematics"],"dc:title":["An Investigation of the Range of a Boolean Function"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:50:15Z"}