The document discusses lattices and Boolean algebra. It defines lattices as sets closed under binary operations of meet and join. It describes properties of lattices including completeness and conditional completeness. It also defines distributive lattices, complemented lattices, bounded lattices, and sub lattices. Boolean algebra is introduced as a complemented distributive lattice. Basic properties and examples of Boolean algebra are provided. Boolean expressions and equivalence are discussed along with logic gates like AND, OR, NOT, NAND, NOR, XOR, and XNOR.
---TABLE OF CONTENT---
Introduction
Differences between crisp sets & Fuzzy sets
Operations on Fuzzy Sets
Properties
MF formulation and parameterization
Fuzzy rules and Fuzzy reasoning
Fuzzy interface systems
Introduction to genetic algorithm
---TABLE OF CONTENT---
Introduction
Differences between crisp sets & Fuzzy sets
Operations on Fuzzy Sets
Properties
MF formulation and parameterization
Fuzzy rules and Fuzzy reasoning
Fuzzy interface systems
Introduction to genetic algorithm
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
Defuzzification is the process of producing a quantifiable result in Crisp logic, given fuzzy sets and corresponding membership degrees. It is the process that maps a fuzzy set to a crisp set. It is typically needed in fuzzy control systems.
This presentation gives a brief idea about Interpolation. Methods of interpolating with equally/unequally spaced intervals. Please note that not all the methods are being covered in this presentation. Topics like extrapolation and inverse interpolation have also been kept aside for another ppt.
Its states Periodic function, Fourier series for disontinous function, Fourier series, Intervals, Odd and even functions, Half range fourier series etc. Mostly used as active learning assignment in Degree 3rd sem students.
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
Defuzzification is the process of producing a quantifiable result in Crisp logic, given fuzzy sets and corresponding membership degrees. It is the process that maps a fuzzy set to a crisp set. It is typically needed in fuzzy control systems.
This presentation gives a brief idea about Interpolation. Methods of interpolating with equally/unequally spaced intervals. Please note that not all the methods are being covered in this presentation. Topics like extrapolation and inverse interpolation have also been kept aside for another ppt.
Its states Periodic function, Fourier series for disontinous function, Fourier series, Intervals, Odd and even functions, Half range fourier series etc. Mostly used as active learning assignment in Degree 3rd sem students.
FYBSC IT Digital Electronics Unit II Chapter I Boolean Algebra and Logic GatesArti Parab Academics
Boolean Algebra and Logic Gates:
Introduction, Logic (AND OR NOT), Boolean theorems, Boolean
Laws, De Morgan’s Theorem, Perfect Induction, Reduction of Logic
expression using Boolean Algebra, Deriving Boolean expression from
given circuit, exclusive OR and Exclusive NOR gates, Universal Logic
gates, Implementation of other gates using universal gates, Input
bubbled logic, Assertion level.
Rai University provides high quality education for MSc, Law, Mechanical Engineering, BBA, MSc, Computer Science, Microbiology, Hospital Management, Health Management and IT Engineering.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
BCA_Semester-II-Discrete Mathematics_unit-iii_Lattices and boolean algebra
1. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
LATTICES AND BOOLEAN ALGEBRA
COURSE-BCA
Subject- Discrete Mathematics
Unit-III
RAI UNIVERSITY, AHMEDABAD
2. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
Lattices and Boolean algebra
Lattices:
Let L be a non-empty set closed under two binary operations called meet and join
denoted respectively by ⋀ ⋁ . Then L is called a lattice if the following
axioms hold where, a,b,c are element in L.
[ ] Commutative law:
∧ = ∧ ∨ = ∨
[ ] Associative law:
( ∧ ) ∧ = ∧ ( ∧ ) ( ∨ ) ∨ = ∨ ( ∨ )
[ ] Absorption law:
∧ ( ∨ ) = ∨ ( ∧ ) =
We will sometimes denote the lattice by ( ,∧,∨). When we want to know which
operations are involved.
Properties Of lattice:
1. Completeness:
A poset is called complete lattice if all its subsets have both a join and a meet.
Every complete lattice is bounded.
2. Conditional Completeness:
A conditional complete lattice is a lattice in which every non-empty subset that that
has that has an upper bound or has a join. (i.e. a least upper bound)
A conditionally complete lattice is either a complete lattice or a complete lattice
without its maximum element 1, its minimum element 0, or both.
Complete Lattice:
A poset is called complete lattice if all subsets have both a join and a meet.
3. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
Bounded Lattice:
A bounded lattice is an algebraic structure of the form ( ,∨,∧ ,1,0) such that
( ,∨,∧) is a lattice, 0 (the lattices bottom) is the identity element for the join
operation ∨, and 1 (the lattice top) is the identity element for the meet operation ∧.
Identity laws
∨ 0 = ∨ 1 = 1
∧ 1 = ∧ 0 = 0
The non negative integers with the usual ordering
0 < 1 < 2 < 3…….
Have 0 as a lower bound but have no upper bound.
On the other hand the lattice P(U) of all subsets of any Universal set U is a
bounded lattice with U as an upper bound and the empty set ∅ as a lower bound.
Suppose = { , , , … … } is a finite lattice.
Then { ∨ ∨ ∨ … … ∨ } are upper and lower bounds for L respectively.
Theorem:
Every finite lattice L is bounded.
Distributive Lattice:
A lattice L is said to be distributive if for any elements a, b, c in L we have the
following distributive law:
∧ ( ∨ ) = ( ∧ ) ∨ ( ∧ )
&
∨ ( ∧ ) = ( ∨ ) ∧ ( ∨ )
Otherwise L is said to be non distributive.
The only non distributive lattices with fewer than 6 elements are called & .
4. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
A lattice is distributive if and only if it does not have a sub lattice isomorphic
to .
Smallest non distributive Smallest non modular (and hence non
distributive) lattice N5
(but modular) lattice M3 (and hence non distributive) lattice N5
Complemented Lattice:
Let L be a bounded lattice with lower bound 0 and upper bound 1.Let a be an
element of L.
An element in L is called a complement of 0 if
∨ = and ∧ = 0
Complements need not exist and need not unique.
Example:
5. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
Introduction to Boolean Algebra:
Boolean algebra is the algebra of two-valued logic with only sentential
connectives, or equivalently of algebras of sets under union and complementation.
The rigorous concept is that of a certain kind of algebra, analogous to the
mathematical notion of a group. This concept has roots and applications in logic,
set theory , topology, foundations of set theory (Boolean-valued models), measure
theory (measure algebras), functional analysis (algebras of projections), and ring
theory (Boolean rings). The study of Boolean algebras has several aspects:
structure theory, model theory of Boolean algebras, decidability and undesirability
questions for the class of Boolean algebras, and the indicated applications. In
addition, although not explained here, there are connections to other logics,
subsumption as a part of special kinds of algebraic logic, finite Boolean algebras
and switching circuit theory and Boolean matrices.
Definition simple properties:
Boolean algebra is one of the most interesting and important algebraic structure
which has significant applications in switching
circuits, logic and many branches of computer science and engineering.
Boolean algebra can be viewed as one of the special type of lattice.
A complemented distributive lattice with 0 and 1 is called Boolean algebra.
Generally Boolean algebra is denoted by (B, *, , ', 0, 1).
Example 1 :
6. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
(P (A), , , ‘ ,) is a Boolean algebra. This is an important example of Boolean
algebra [In fact the basic properties of
the (P (A), , , ‘) led to define the abstract concept of Boolean algebra]. Further, it
can be proved that every finite Boolean
algebra must be isomorphic to (P (A), , , ' , A) for a suitably chosen finite
set A.
Simple properties of Boolean Algebra:
x + (x · y) = x
x · (x + y) = x
x + (−x) = 1
x · (−x) = 0
Sub Boolean algebra:
The Boolean algebra (Bn
, *, Å , ', 0,1) plays an important role in the construction of
switching circuits, electronic circuits and other applications. Also it can be proved
that every finite Boolean algebra is isomorphic to the above Boolean algebra (Bn
,
*, Å , ', 0,1), for some n. Thus, it is interesting to observe that number of elements
in any finite Boolean algebra must be
always 2n
, for some n.
Let (B, *, Å , ' , 0,1) be a Boolean algebra and S Í B. If S contains the elements 0
and 1 and is closed under the operation *, Å and ' then (S, *, Å , ', 0,1) is called
sub Boolean algebra.
Example :
Consider the Boolean algebra (P ({1,2,3}), Ç , È , ' ,f , {1,2,3})
Then (S = {f , {1}, {2,3}, {1,2,3}}, Ç , È , ', f , {1,2,3}) is also sub Boolean
algebra.
Similarly, S = ({f ,{3},{1,2},{1,2,3}}, Ç , È , ', f , {1,2,3}) is also sub Boolean
algebra.
But (S = ({f, {1}, {2,3}, {1,2,3}}, Ç , È ,' , f , {1,2,3})) is not a sub Boolean
algebra.
7. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
Isomorphic Boolean algebra:
Let < ,∗,⊕, , 0,1 > & < , ⋂, ⋃, −, , > be two Boolean algebras.
A mapping : → is called Boolean homomorphism if all the operations of
the Boolean algebra are preserved.
It means that for any , ∈
( ∗ ) = ( ) ∩ ( )
( ⊕ ) = ( ) ∪ ( )
( ) = ( )
(0) =
(1) =
If the mapping is one-one also in addition to being homomorphism, then this
mapping is called isomorphism.
In particular if & are two Boolean algebra with respect to the same operation
⊕,∗ ,0,1 then : → is called isomorphism if
1. is one-one.
2. ( ⊕ ) = ( ) ⊕ ( )
3. ( ∗ ) = ( ) ∗ ( )
4. ( ) = ( )
For any , ∈ & are said to be isomorphic Boolean algebra.
Definition: Join Irreducible
Let < ,∗,⊕> an element ∈ is called Join-irreducible if it cannot be expressed
as the join (LUB) of two distinct elements.
Atom:
Let < ,∗,⊕> be a lattice & ∈ , then is said to be an atom if
a. is join-irreducible
8. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
b. is covers of 0-element.
Boolean Expressions and their equivalence:
Boolean algebra uses Boolean variables and Boolean operators. Boolean variables
are binary variables and Boolean operators are logical operators. Some examples
of Boolean variables are A, B, C, a, b, c, X, Y, and Z.
There are three basic logical operators:
AND, OR, and NOT.
A Boolean expression is a combination of Boolean variables and Boolean
operators. There are many Boolean expressions that are logically equivalent to one
another. There are called equivalent expressions.
A Boolean function typically has one or more input variables and produces a result
that is based on these input values. The result can have a value of 0 or 1.
Most of the subsystems of a digital system take the form of a switching network. A
switching network has one or more inputs and can have one or more outputs. Each
output can be represented by a Boolean function with n variables.
2-input AND Gate
For a 2-input AND gate, the output Q is true if BOTH input A “AND” input B are
both true, giving the Boolean Expression of: ( Q = A and B ).
AND OR NOT
9. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
Note that the Boolean Expression for a two input AND gate can be written as: A.B
or just simply AB without the decimal point.
2-input OR (Inclusive OR) Gate
For a 2-input OR gate, the output Q is true if EITHER input A “OR” input B is
true, giving the Boolean Expression of: ( Q = A or B ).
NOT Gate
For a single input NOT gate, the output Q is ONLY true when the input is “NOT”
true, the output is the inverse or complement of the input giving the Boolean
Expression of: ( Q = NOT A ).
10. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
The NAND and the NOR Gates are a combination of the AND and OR Gates with
that of a NOT Gate or inverter.
2-input NAND (Not AND) Gate
For a 2-input NAND gate, the output Q is true if BOTH input A and input B are
NOT true, giving the Boolean Expression of: ( Q = not(A and B) ).
2-input NOR (Not OR) Gate
For a 2-input NOR gate, the output Q is true if BOTH input A and input B are
NOT true, giving the Boolean Expression of: ( Q = not(A or B) ).
11. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
As well as the standard logic gates there are also two special types of logic gate
function called an Exclusive-OR Gate and an Exclusive-NOR Gate. The actions of
both of these types of gates can be made using the above standard gates however,
as they are widely used functions, they are now available in standard IC form and
have been included here as reference.
2-input EX-OR (Exclusive OR) Gate
For a 2-input Ex-OR gate, the output Q is true if EITHER input A or if input B is
true, but NOT both giving the Boolean Expression of: ( Q = (A and NOT B) or
(NOT A and B) ).
2-input EX-NOR (Exclusive NOR) Gate
12. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
For a 2-input Ex-NOR gate, the output Q is true if BOTH input A and input B are
the same, either true or false, giving the Boolean Expression of: ( Q = (A and B) or
(NOT A and NOT B) ).
Summary of 2-input Logic Gates
The following Truth Table compares the logical functions of the 2-input logic
gates above.
Inputs Truth Table Outputs For Each Gate
A B AND NAND OR NOR EX-
OR
EX-
NOR
0 0 0 1 0 1 0 1
0 1 0 1 1 0 1 0
1 0 0 1 1 0 1 0
1 1 1 0 1 0 0 1
The following table gives a list of the common logic functions and their equivalent
Boolean notation.
Logic Function Boolean Notation
AND A.B
OR A+B
NOT A
NAND A .B
NOR A+B
13. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
EX-OR (A.B) + (A.B) or A B
EX-NOR (A.B) + or A B
Example
Find the Boolean algebra expression for the following system.
The system consists of an AND Gate, a NOR Gate and finally an OR Gate. The
expression for the AND gate is A.B, and the expression for the NOR gate is A+B.
Both these expressions are also separate inputs to the OR gate which is defined as
A+B. Thus the final output expression is given as:
The output of the system is given as Q = (A.B) + (A+B), but the notation A+B is
the same as the De Morgan´s notation A.B, Then substituting A.B into the output
expression gives us a final output notation of Q = (A.B)+(A.B), which is the
Boolean notation for an Exclusive-NOR Gate as seen in the previous section.
Inputs Intermediates Output
B A A.B A + B Q
0 0 0 1 1
0 1 0 0 0
1 0 0 0 0
14. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
1 1 1 0 1
Then, the whole circuit above can be replaced by just one single Exclusive-NOR
Gate and indeed an Exclusive-NOR Gate is made up of these individual gate
functions.
Example
Find the Boolean algebra expression for the following system.
This system may look more complicated than the other two to analyse but again,
the logic circuit just consists of simple AND, OR and NOT gates connected
together.
As with the previous Boolean examples, we can simplify the circuit by writing
down the Boolean notation for each logic gate function in turn in order to give us a
final expression for the output at Q.
15. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
The output from the 3-input AND gate is only at logic “1” when ALL the gates
inputs are HIGH at logic level “1” (A.B.C). The output from the lower OR gate is
only a “1” when one or both inputs B or C are at logic level “0”. The output from
the 2-input AND gate is a “1” when input A is a “1” and inputs B or C are at “0”.
Then the output at Q is only a “1” when inputs A.B.C equal “1” or A is equal to
“1” and both inputs B or C equal “0”, A.(B+C).
By using “de Morgan’s theorem” inputs B and input C cancel out as to produce
an output at Q they can be either at logic “1” or at logic “0”. Then this just leaves
input A as the only input needed to give an output at Q as shown in the table
below.
Inputs Intermediates Output
C B A A.B.C B C B+C A.(B+C) Q
0 0 0 0 1 1 1 0 0
0 0 1 0 1 1 1 1 1
0 1 0 0 0 1 1 0 0
0 1 1 0 0 1 1 1 1
1 0 0 0 1 0 1 0 0
1 0 1 0 1 0 1 1 1
1 1 0 0 0 0 0 0 0
1 1 1 1 0 0 0 0 1
Minterms and Maxterms:
Each row of a truth table can be associated with a minterm, which is a product
(AND) of all variables in the function, in direct or complemented form. A minterm
has the property that it is equal to 1 on exactly one row of the truth table.
Here is the three-variable truth table and the corresponding minterms:
minterm
0 0 0
0 0 1
16. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
The subscript on the minterm is the number of the row on which it equals 1. (The
row numbers are obtained by reading the values of the variables on that row as a
binary number.)
Minterms provide a way to represent any Boolean function algebraically, once its
truth table is specified. The function is given by the sum (OR) of those minterms
corresponding to rows where the function is 1. By the minterm property, the OR
will contain a term equal to 1 (making the function 1) on exactly those rows where
the function is supposed to be 1.
Example—
Suppose a function is defined by the following truth table:
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
Since on rows 1, 2, 4, and 7, we obtain
A compact notation is to write only the numbers of the minterms included in ,
using the Greek letter capital sigma to indicate a sum:
17. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
This form can be written down immediately by inspection of the truth table.
The foregoing proves that once we have specified a Boolean function by means of
its truth table, we are (in principle) able to implement it by means of logic gates
that perform the AND, OR, and NOT functions.
Equivalence of two functions:
Two Boolean expressions represent the same function if their truth tables are
identical. In form they will be the same.
Each row of a truth table is also associated with a Maxterm, which is a sum (OR)
of all the variables in the function, in direct or complemented form. A Maxterm
has the property that it is equal to 0 on exactly one row of the truth table.
Here is the three-variable truth table and the corresponding Maxterms:
Maxterms
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Like minterms, Maxterms also provide a way to represent any Boolean function
algebraically once its truth table is specified. The function is given by the product
(AND) of those Maxterms corresponding to rows where the function is 0. By the
Maxterms property, the AND will contain a term equal to 0 (making the function
0) on exactly those rows where the function is supposed to be 0.
18. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
Example: for the same function as previously, we observe that it is 0 on rows 0, 3,
5, and 6. So
This form also lends itself to a compact notation: using the Greek letter capital pi
to denote a product, we write only the numbers of the Maxterms included in :
Two Boolean functions are equivalent if their forms are the same.
The and notational forms for a given function are related: each form contains
all the row numbers omitted in the other form.
19. Unit-III Lattices and Boolean algebra
Rai University, Ahmedabad
References:
http://plato.stanford.edu/entries/boolalg-math/#elem
http://venus.cs.qc.cuny.edu/~vivek/csci343_1129/supp/Boolean%20Algebra.pdf
http://www.electronics-tutorials.ws/boolean/bool_7.html
http://www.dsm.fordham.edu/~moniot/Classes/CompOrganization/boolean-outline/node4.html