
	Where results make sense

Topic: Logical disjunction

Related Topics

Disjunction

Logical conjunction

Exclusive disjunction

Union (sets)

Logical negation

Propositional logic

Logic

Boolean algebra

Digital logic

Logic gate

Distributivity

DeMorgans Law

Commutative operation

Set theory

Series and parallel circuits

In the News (Wed 25 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Logical disjunction - Wikipedia, the free encyclopedia
		In mathematics, logical disjunction (usual symbol or) is a logical operator that results in true if either of the operands is true.
		In logic and mathematics, a disjunction is an "or statement".
		Because of this, logical disjunction satisfies many of the same identities as set-theoretic union, such as associativity, commutativity, distributivity, and de Morgan's laws.
	en.wikipedia.org /wiki/Logical_disjunction (459 words)

	Logical NOR - Wikipedia, the free encyclopedia
		The Logical nor or joint denial is a boolean logic operator which produces a result that is the inverse of logical or.
		The two-input logical NOR operator is commonly described by a truth table, describing the output state for all possible input combinations:
		NOR has the interesting feature that all other logical operators can be expressed by various functions of nor.
	en.wikipedia.org /wiki/Logical_nor (371 words)

	Exclusive disjunction - Wikipedia, the free encyclopedia (Site not responding. Last check: 2007-11-06)
		In logic, the treatment of the word or requires a little care, for a native English language speaker (some other languages have greater precision).
		The exclusive disjunction of propositions A and B is usually called A xor B, where "xor" stands for "exclusive or" and is pronounced "eks-or".
		In digital logic design, a two-input xor logic gate is often thought of as a programmable inverter, in that if one input is held at a logic '1', the output will be the inverse of the other input.
	www.encyclopedia-online.info /XOR (584 words)

	Logical conjunction : And
		In logic and technical fields that use it, conjunction, or and, is a logical operator in logical calculi.
		Logically, this would be denoted by saying that A stands for "it's raining", B stands for "I'm inside", together A AND B.
		Logically, the sentence "it's raining, but the sun is shining" is equivalent to "it's raining, and the sun is shining", so logically, "but" is equivalent to "and".
	www.findword.org /an/and.html (824 words)

	The Meanings of Logical Constants
		The meanings of logical constants are determined by the role these constants play in reasoning, whereas the meanings of non-logical predicates are not to the same extent determined by the role such predicates play in reasoning.
		A sequent calculus is a `multiple conclusion logic', whose multiple conclusions are in a certain sense understood disjunctively.
		I have not been able to respond to all her worries, To mention one point, she argued forcefully that the meanings of the logical constants might be determined holistically in the sense that, for example the meaning of disjunction might be affected by whether classical negation was present.
	www.nyu.edu /gsas/dept/philo/courses/concepts/meaning.html (3173 words)

	Section 1.1 Review
		To test for logical equivalence of 2 statements, construct a truth table that includes every variable to be evaluated, and then check to see if the resulting truth values of the 2 statements are equivalent.
		The negation of a conjunction (logical AND) of 2 statements is logically equivalent to the disjunction (logical OR) of each statement's negation.
		Logical equivalencies can be used to simplify statement forms, to confirm or disprove an equivalency, to create efficient and logically correct computer programs, or to aid in the design of digital logic circuits.
	www.keyano.ca:8080 /mejsmont/courses/bus112/DM/chapters/review1_1.html (757 words)

	The Ultimate Logical conjunction Dog Breeds Information Guide and Reference
		Logical conjunction (usual symbol and) is a logical operator that results in true if both of the operands are true.
		In logic and technical fields that use it, conjunction, or and, is a logical operator in logical calculi, and a rule of inference in deductive systems.
		The analogue of conjunction for a (possibly infinite) family of statements is universal quantification, which is part of predicate logic.
	www.dogluvers.com /dog_breeds/AND (556 words)

	Chap 9 Notes (Site not responding. Last check: 2007-11-06)
		A disjunction (indicated by "v") is a compound claim asserting either or both of the simpler claims contained in it.
		Categorical logic remains with the forms of natural sentences; truth-functional logic--like all modern logic, of which it is a part--departs from ordinary grammar.
		Logic gives one reason: If we were to call sentences of this form false, the truth table for "If A, then B" would turn out identical to the one for "If B, then A." (Work them out and see.) But we want the two to mean different things.
	www.humboldt.edu /~campbell/p100lectch9.htm (6271 words)

	Addison W. Moore: Reformation of Logic (Site not responding. Last check: 2007-11-06)
		If the whole enterprise of logical operation, of the construction and verification of hypothesis, is in the interest of the removal of ambiguity, and inhibition in conduct, the only relevant truth or falsity they can possess must be determined by their success or failure in that undertaking.
		The prominence in current discussion of the logical reforms proposed by the " analytic logic " of the neorealistic movement and the enthusiastic optimism of its representatives over the prospective results of these reforms for logic, science, and practical life are the war-rant for devoting a special section to their discussion.
		First it is clear that logical operations are of the same reproductive repetitive type that we have found in the associational logic of empiricism, and in the logic of the objective universal.
	spartan.ac.brocku.ca /~lward/Moore/Moore_1917_1.html (10549 words)

	34 Natural Conditional: Features
		Their connections can be defined like multiple logical disjunctions, except with reference to numbers of actualities or inactualities, instead of truths or falsehoods.
		Natural disjunction has a very different basis from logical disjunction; much more information is demanded of us, before we can formulate a natural one.
		For instance, even though there is no such thing as actual natural disjunction, a proposition of the form 'S is P or Q' might be intended to mean 'S must be P or Q', rather than imply mere logical disjunction.
	www.thelogician.net /2_future_logic/2_chapter_34.htm (4327 words)

	[Inquiry] Re: Logic Of Relatives
		The "number of" map exhibits a certain type of "uniformity property", whereby the value of the measure on a uniformly qualified population is in fact actualized by each member of the population.
		The "number of" map satisfies an "order morphism principle", whereby the illative partial ordering of logical terms is reflected up to a partial extent by the arithmetical linear ordering of their measures.
		The "invertible addition" is signified in algebra by "+", corresponding to what we'd call the exclusive disjunction of logical terms or the symmetric difference of their sets, ignoring many details and nuances that are often important, of course.
	stderr.org /pipermail/inquiry/2003-April/000301.html (558 words)

	Logical Expressions (Site not responding. Last check: 2007-11-06)
		Logical disjunction (inclusive OR): the expression is true if either A, B, or both, are true.
		Logical inequivalence (exclusive OR): the expression is true if either A or B is true, but false if both are true.
		Logical equivalence: the expression is true if both A and B are true, or both are false.
	www.helsinki.fi /atk/unix/dec_manuals/df90au52/lrm0065.htm (370 words)

	Exclusive disjunction - Unipedia (Site not responding. Last check: 2007-11-06)
		Exclusive disjunction (usual symbol xor) is a logical operator that results in true if one of the operands, but not both of them, is true.
		The exclusive disjunction of propositions A and B means A or B, but not both, as in "you can follow the rules or be disqualified".
		The exclusive disjunction of propositions A and B is usually called A xor B, where "xor" stands for "exclusive or" and is pronounced "eks-or" or "zor".
	www.unipedia.info /Xor.html (630 words)

	Math Notes - Relations
		The method of proofs is based on a style developed in A Logical Approach to Discrete Math, though the approach used here is quite different from the set theorems in Gries’ text.
		The context in which the expression P is used should determine whether the usage refers to an expression or a set.
		Suppose that A is the set of all apple packages sold where the number of apples sold is 10, and that B is the set of all cash transactions where the amount is $5.00.
	home.att.net /~p.konieczko/mathrel13.html (1153 words)

	Spatial Automation Laboratory (Site not responding. Last check: 2007-11-06)
		Thus, just as any logical function can be written using only three operations Â (logical negation or NOT), \/ (logical disjunction or OR), and /\ (logical conjunction or AND), three corresponding R-functions can be combined into a corresponding R-function.
		Expressed another way, for every formal logical sentence (i.e., for every Boolean function), one may construct a corresponding R-function using R-conjunction, R-disjunction, and R-negation, whose sign is determined by the truth table of the logical sentence.
		The logical disjunction \/ and conjunction /\ operations can respectively be accomplished in the usual case by performing intersection and union operations.
	sal-cnc.me.wisc.edu /Research/meshless/R-functions/R-functions.html (495 words)

	Or Operator
		Used to perform a logical disjunction on two Boolean expressions, or bitwise disjunction on two numeric values..
		For Boolean comparison the result is the logical disjunction of two expressions.
		For bitwise operations the result is a numeric value resulting from the bitwise disjunction of two numeric expressions.
	www.nedcomp.nl /support/origdocs/dotnetsdk/vblr7net/vaopror.htm?ntp=1 (326 words)

	A many-valued logic for approximate reasoning
		In an Extended Post system there are as many operations of logical disjunction and logical conjunction as there are truth values.
		The truth value associated with a particular operation of disjunction (conjunction) acts as a threshold value controlling the behavior of the operation.
		It is shown that there exist distinct isomorphic copies of fuzzy logic, each corresponding to a distinct level of approximation and being complete to resolution.
	domino.research.ibm.com /tchjr/journalindex.nsf/0b9bc46ed06cbac1852565e6006fe1a0/8affe85aad4c507385256bfa0067f713?OpenDocument (190 words)

	[No title]
		A relational operator that compares two expressions forms a logical expression (or Boolean expression); this is an expression that evaluates to be either True or False.
		The OR operators performs logical disjunction of two expression; the result is True if either or both expressions evaluate to True.
		The NOT operators performs a logical negation of an expression; the result is the opposite of the expression evaluation.
	www.southtexascollege.edu /gviera/comparison.doc (365 words)

	Chapter One Advanced High Level Control Structures
		One obvious omission in HLA's high level control structures is the ability to use conjunction (logical AND), disjunction (logical OR), and negation (logical NOT) in run-time boolean expressions.
		HLA uses the "" operator to denote disjunction (logical OR) in a run-time boolean expression.
		The logical not operator is primarily useful for surrounding complex expressions involving the conjunction and disjunction operators.
	webster.cs.ucr.edu /AoA/Linux/HTML/AdvancedCtrlStructures.html (5372 words)

	Deductive Arguments II: Truth-Functional Logic
		Truth-functional or propositional logic is the simplest part of symbolic logic, though you will find it both rigorous enough to let you carry out systematic proofs and broad enough to handle a wide range of ordinary arguments.
		The first significant work in analyzing and operating on claims with truth-functional logic is the work of translating them into symbolic form.
		Because ordinary language often gives us compounds with implied or submerged logical relations, we have to begin by making sure we know what they mean.
	highered.mcgraw-hill.com /sites/0072818816/student_view0/chapter9 (4607 words)

	Logical disjunction Stanford Encyclopedia of Philosophy entry mathematics Bitwise operation See also Boolean algebra ... (Site not responding. Last check: 2007-11-06)
		Logical disjunction Stanford Encyclopedia of Philosophy entry mathematics Bitwise operation See also Boolean algebra set theoretic union logical operator xor Boole logic
		Performs a logical disjunction on two Boolean expressions, or a bitwise disjunction on two numeric expressions.
		The Or Operator (Visual Basic) performs logical disjunction or inclusion on two Boolean expressions.
	en.powerwissen.com /F4Vao\|\|SL\|\|mI3xSAyVct4jUoQQ==_Disjunction.html (403 words)

	[No title]
		According to the logic we have constructed, the sentence Paul sang and danced is true if Paul sang on Tuesday and danced on Wednesday, but this interpretation doesn’t correspond to my intuition about the meaning of the sentence.
		Propositional logic predicts that these sentences can be conjoined in either order, but English insists on an iconic relation between the order of events and their conjunction.
		The English expression is not a good translation for logical equivalence (‘≡’) which is symmetric both syntactically and semantically, i.e., A≡B is equivalent to B≡A. The proposition A—>BandB—>A is another translation for logical equivalence and is also symmetric.
	www.ku.edu /~pyersqr/Ling331/Kearns2.htm (3485 words)

	No true Scotsman - Free Encyclopedia of Thelema
		When considering this argument in a context of rhetorical logic, this is a fallacy if the predicate ("putting sugar on porridge") is not actually contradictory for the accepted definition of the subject ("Scotsman"), or if the definition of the subject is silently adjusted after the fact to make the rebuttal work.
		In logic, the mutually exclusive contradiction is called a logical disjunction.
		This type of argument is frequently used in contexts of identity, where it is easier for it to hold weight.
	www.egnu.org /thelema/index.php/No_true_Scotsman (389 words)

	Language Reference
		The precedence of the operators determines the order of evaluation when a logical expression containing two or more operators having different precedence is evaluated.
		Sometimes a logical expression does not need to be completely evaluated to determine its value.
		For binary logical operations with operands that have different kind type parameters, the kind type parameter of the expression is the same as the larger length of the two operands.
	www.unm.edu /cirt/introductions/aix_xlfortran/xlflrm50.htm (1175 words)

	KCGL1 Help F90 Data Expressions Logical (Site not responding. Last check: 2007-11-06)
		Logical expressions can contain one or more logical operators and logical, integer, or relational operands.
		Logical disjunction (inclusive OR): the ex- pression A.OR.
		Logical inequivalence (or exclusive OR): the expression A.NEQV.
	www.people.memphis.edu /HELP/F90/DATA/EXPRESSIONS/LOGICAL (103 words)

	VBA For MS Access - Lesson 20: Data Analysis
		This type of statement is referred to as logical disjunction.
		The logical disjunction is expressed in Microsoft Access and in SQL with the OR operator.
		As done for the logical conjunction, before applying a logical disjunction to a table, a query in Datasheet View or a form in Form View, first display it in Filter By Form:
	www.functionx.com /vbaccess/Lesson20c.htm (567 words)

	OrElse Operator (Visual Basic .NET)
		Used to perform short-circuiting logical disjunction on two expressions.
		A logical operation is said to be short-circuiting if the compiled code can bypass the evaluation of one expression depending on the result of another expression.
		If the result of the first expression evaluated determines the final result of the operation, there is no need to evaluate the other expression, because it cannot change the final result.
	msdn.microsoft.com /library/en-us/vblr7/html/valrfOrElseOperator.asp?frame=true (247 words)

Try your search on: Qwika (all wikis)