answersLogoWhite

0

Binary logic has only two possible values:TRUE or FALSE and these are coded as 1 and 0.

User Avatar

Wiki User

9y ago

Still curious? Ask our experts.

Chat with our AI personalities

RafaRafa
There's no fun in playing it safe. Why not try something a little unhinged?
Chat with Rafa
LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran

Add your answer:

Earn +20 pts
Q: Why we use only ''0'' and ''1'' in logic?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

When A 0 B 0 C 1 then in 2 input logic gate you get - - gate?

input outA B A XNOR B 0 0 1 0 1 0 1 0 0 1 1 1


Why is Boolean logic important in computer science?

Boolean logic can be thought of as "0 and 1" logic, or "True or False" logic. Boolean math started out as "True or False" expressions. In computers, the bits stored in memory are interpreted as either a '0' or a '1' (binary numbers). Computer scientists (usually, though you can prove out the concept either way) map '0' = FALSE and '1' = 'TRUE', and thus the operations and decisions made in a computer can be expressed/evaluated as Boolean logic/math expressions.


Is there a way to show that 1 equals 0?

Only if you use flawed math.Only if you use flawed math.Only if you use flawed math.Only if you use flawed math.


Positive logic in a logic circuit is one in which?

In Positive logic, we all assume that the more positive (binary) voltage state is One, the less positive voltage state is Zero.Both voltage states could be positive, both could be negative, or they could be opposite polarities.


How boolean algebra helps modern computer?

George Boole developed a mathematical notation which is suited to the analysis or design of switching.a) a switch may be only on or offb) assume 1 equals on, and 0 equals offExample: two switches in series,if both are on will have a combined value of 1.Boolean 1 + 1 = 1 (aka and + and = and)if one switch were on and the other off, the combination is 0Boolean 1 + 0 = 0 (aka and + not = not) nand is 'not and'.if both switches were off, then the combined value is off.Boolean 0 + 0 = 0 (aka not + not = not)You may perform a similar analysis for a pair of switches in parallel.c) the truth values given are arbitrary. The logic system will work equally well if 1's are replaced with 0's and vice versa but the truth tables will differ.From such simple beginnings, a sufficient logic system may be built to solve problems that can be expressed as equations.This is called 'machine language' in its simplest form.