
	Where results make sense

Topic: DeMorgans Law

Related Topics

Laws of logic

Logic

Negation normal form

Kripke semantics

Mathematical logic

Augustus De Morgan

Union (sets)

Propositional logic

Logical conjunction

Boolean algebra

Truth table

List of topics in logic

Logical disjunction

Exclusive disjunction

Digital circuit

In the News (Sun 29 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	[No title]
		DeMorgans Law ~(P v Q) DeMorgans Law ~(P ^ Q) (~P v ~Q)
		Associative Law P v (Q v R) (P v Q) v R % Rules w/ 3 propositional variables
		Associative Law P ^ (Q ^ R) Distributive Law P ^ (Q v R) (P ^ Q) v (P ^ R) Distributive Law P v (Q ^ R) (P v Q) ^ (P v R)
	www.cs.wustl.edu /~pless/240/lectures/lecture02.html (764 words)

	De Morgan's laws - Encyclopedia, History, Geography and Biography
		In logic, De Morgan's laws (or De Morgan's theorem) are rules in formal logic relating pairs of dual logical operators in a systematic manner expressed in terms of negation.
		De Morgan's observation influenced the algebraisation of logic undertake by George Boole, so cementing his claim to the find, although a similar observation was made by Aristotle and was known to Greek and Medieval logicians (cf.
		In extensions of classical propositional logic, the duality still holds (that is, to any logical operator we can always find its dual), since in the presence of the identities governing negation, one may always introduce an operator that is the De Morgan dual of another.
	www.arikah.net /encyclopedia/DeMorgans_Law (537 words)

	DeMorgan's Law (Site not responding. Last check: 2007-10-26)
		DeMorgan's law is a rule of inference pertaining to the NOT, AND, and OR operators.
		DeMorgan's law is used to distribute a negative to a conjunction or disjunction.
		In our example, DeMorgan's law takes an expression with a conjunction and transforms it into a disjunction, negating each member of the expression.
	lc.brooklyn.cuny.edu /LeftBarFiles/FromAboutLC/Core5Files/Logic/demorg.html (500 words)

	Assistance prooving the law of constructive dilema (Site not responding. Last check: 2007-10-26)
		The =problem involves prooving the Law of Constructive Dilema.
		I have hit =a snag somewhere in the middle of the problem, and want to see if I =have done something wrong or if there is something I missed, because =the problem is spiralling out of control fast.
		=Here is what I have got so far =Law of constructive Dilema: =[(p or q) and (p -= q) and (q -= s)] == (r or s) Okay.
	www.thehelparchive.com /new-3050876-279.html (208 words)

	De Morgan's laws - Wikipedia, the free encyclopedia
		One of DeMorgan's laws tells us that these two formulas are equivalent.
		This idea can be generalised to quantifiers, so for example the universal quantifier and existential quantifier are duals:
		Then, the quantifier dualities can be extended further to modal logic, relating the box and diamond operators:
	www.wikipedia.org /wiki/DeMorgans_Law (470 words)

	DeMorgans Law (Site not responding. Last check: 2007-10-26)
		In logic, De Morgan's laws (or De Morgan's theorem), named fornineteenth century logician and mathematician Augustus DeMorgan, are the two rules of propositional logic, boolean algebra and settheory
		Common uses of De Morgan's rules are in digital circuit design,where it is used to manipulate the types of logic gates, and in formal logic,where it is one of the rules used to transform logical formulae into negation normal form, a prerequisite for conjunctive or disjunctivenormal form.
		This idea can be generalised to include the universal and existential quantifiers in classical logic as DeMorgan duals.
	www.therfcc.org /demorgans-law-137947.html (191 words)

	4DeMorgan
		Y = A * B and apply DeMorgan's Law to it.
		Y = (A + B) and apply DeMorgan's Law to it.
		As final proof that a DeMorganized gate is equilvalent to the original gate, the timing diagrams are compared and if they are equal then the two gates must be equilvalent.
	www.onechipsystems.com /digital/Chap4/4demorgan.htm (872 words)

	Living the dream. (Site not responding. Last check: 2007-10-26)
		The stories and opinions from a law student living in Cincinnati, working as an electrical engineer and going to Salmon P. Chase law school (NKU) at night.
		I don't like eating in a restaurant that is filled with smoke and it even bothers me when I am at a bar and people are smoking excessively...
		Caught the second to last episode of the reality bomb "Law Firm." I think it has dropped so far on the totem pole that I am probably the only one watching it.
	ivealreadygotone.blogspot.com (2222 words)

	boolean
		The laws and identities of Boolean algebra will almost always allow us to simplify a minterm expansion.
		For example, the minterm expansion for a Boolean function f of three variables might be represented as follows (taking the values directly from the truth table):
		An Investigation of the Laws of Thought, 1854, reprinted by New York: Dover Press, 1958.
	cse.stanford.edu /class/cs103a/h9BooleanAlgebra.html (2594 words)

	Logic Tradition, and the Onto-logical Connection - Jack E. Marsh, Jr. - The Examined Life On-Line Philosophy Journal (Site not responding. Last check: 2007-10-26)
		I argue that the law of identity (A is A), and thus the laws of non-contradiction and the excluded middle, requires metaphysical commitments necessary to guarantee the truth function of the conditional form.
		The law of identity on which the two laws depend or imply render the entire procedure problematic.
		This is not justification for chucking the laws of non-contradiction and the excluded middle, we might call these the conditions of intelligibility because their denial implicitly affirms them and without such laws conversation and ascertaining meaning, however provisional, may not be possible.
	examinedlifejournal.com /articles/printerfriendly.php?shorttitle=ontologicalmarsh&authorid=83 (3395 words)

	Talk:De Morgan's laws : Talk:DeMorgans Law (Site not responding. Last check: 2007-10-26)
		I was about to move this to "DeMorgan's Law" -- but I've always seen it as "DeMorgan's Laws", plural.
		These are actually two laws, but they're a pair, and they're always given together.
		As far as I know, DeMorgan hasn't come up with other laws known as such, so I'd go for Tarquin's proposal.
	www.termsdefined.net /ta/talk:demorgans-law.html (166 words)

	De Morgan's laws : DeMorgans Law (Site not responding. Last check: 2007-10-26)
		terms defined : De Morgan's laws : DeMorgans Law
		TThis simple fact is used extensively in digital circuit design for manipulating the types of logic gates used by the circuit.
		I have fought duels and killed men; I have aspired.
	www.termsdefined.net /de/demorgans-law.html (411 words)

	Binary Brain Buster
		is the sum of two terms, which fits the pattern of the right-hand term of the first part of the law
		is used, specifically the negation of the product of two terms on the left-hand side of the first law.
		in the statement of DeMorgan's Law, and upper case
	www.generalnumbers.com /demorgans_application1.html (311 words)

	Law Enforcement Department - Powered By Kayako SupportSuite
		Law Enforcement Department - Powered By Kayako SupportSuite
		Please fill in the fields below to register for a new account.
		Please enter the text you see in the image at the right into the textbox below.
	www.demorgans.net /Ticket/index.php?_m=core&_a=register (49 words)

	Z e B O X artist - Dislife - comments
		PROOV THAT -(a+b)=(-a)(-b)THROUGH Demorgans* law,WITH THE AID OF DIAGRAM.
		Copyright notice: All material on this page copyrighted by Dislife and protected by copyright law and by international treaties.
		You may download this material only for your own personal use.
	zebox.com /dislife/comments (102 words)

	[No title] (Site not responding. Last check: 2007-10-26)
		Given two statements of the form A A -> B B is deduced by mod.
		If I stay up late & get up early it means that I have 5hrs sleep S4 = ~M I cannot have five hours sleep C = ~L v ~H I must not go to my lecture or i must not do my hmework 4.
		Demorgans Law = ~(~L v ~H) = L & H Adopt as premise: write "and-ed" props on separate lines.
	www.csd.abdn.ac.uk /~pgray/teaching/CS5512/prac2.sol (178 words)

	SOLUTIONS TO REVIEW PROBLEMS FOR CS330 TEST 1 (Site not responding. Last check: 2007-10-26)
		º (A Ù ØB) Ú (ØC Ù B) Ú AØ Ú C DeMorgan’s Law (and law of negation)
		(The two instances of conditional law could have been combined and likewise for the two instances of DeMorgans at the beginning.
		Also, it is not always necessary to be explicit about commutative and associative laws, but I did so with commutative law just for the sake of clarity).
	cs.gmu.edu /~bjamison/Test1revanss00.html (281 words)

	Math & Science: Some Mathematics Questions
		Is it have some relations to DeMorgans Law.
		Probably wouldnt be able to propagate light, therefore you wouldnt be able to read this answer.
		#2: DeMorgan's law is something I learned in school 35 yrs ago and I promptly forgot, Sorry.
	www.experts-exchange.com /Miscellaneous/Math_Science/Q_20754856.html (1399 words)

Try your search on: Qwika (all wikis)