Disjunction - sql, PL-SQL Programming

Disjunction (OR, ∨)

Again we have nine rows instead of just four and again, when unknown is not involved, the rows are as for 2VL. Also, when anything is paired with true, the result is true, as in 2VL. Our intuition, that "p or q" is true exactly when at least one operand is true, is preserved.

526_Disjunction (OR, ∨).png

Figure: The SQL Truth Table for Disjunction

Now, in the theory book it is noted that disjunction could equally well be defined in terms of conjunction and negation, as

p ∨ q ≡ ¬ (¬ p ∧ ¬ q)

and the truth table in Figure is given as proof of that equivalence. The question arises, does the same equivalence hold in SQL? To answer that we need to look at the revised Figure.

1667_Disjunction 2.png

Figure: SQL Disjunction in Terms of SQL Negation and SQL Conjunction

Posted Date: 1/18/2013 4:12:59 AM | Location : United States







Related Discussions:- Disjunction - sql, Assignment Help, Ask Question on Disjunction - sql, Get Answer, Expert's Help, Disjunction - sql Discussions

Write discussion on Disjunction - sql
Your posts are moderated
Related Questions
MECHANISTI S THEORY-HAECKEL (1866) - Haeckel stating that after each catalysm, some new organism suddenly forms as a chance event in one stride from inanimate matter and sub

%ROWCOUNT The %ROWCOUNT yields the number of rows affected by the INSERT, UPDATE, or DELETE statement, or returned by a SELECT INTO statement. The %ROWCOUNT yields zero when a

Advantages of Exceptions Using the exceptions for the error handling has many benefits. Without an exception handling, every time you issue a command, you should ensure for th

FOR-LOOP While the number of iterations through a WHILE loop is unknown till the loop completes, then the number of iterations through a FOR loop is known before the loop is ent

Hi,am developing a library system and relating all the table is somehow complex,could you kindly assist me

Create a Oracle procedure to produce vertical output format when selecting rows from a database table.

Logical Connectives - SQL SQL's extended truth tables in which the symbol, for unknown, appears along with the usual T and F. Negation (NOT, ¬) Conjunction (

Using RENAME in combination with JOIN - SQL Example gives pairs of ids of students having the same name, by joining two renamings of IS_CALLED. Example gives an equivalent ex

Question: a) Given the following relation: Location(loc_id, bldg_code, room, capacity) The underlined field is a primary key. (i) Write a PL/SQL program using the impl

Disjunction (OR, ∨) Again we have nine rows instead of just four and again, when unknown is not involved, the rows are as for 2VL. Also, when anything is paired with true, t