Tautologies, PL-SQL Programming

Assignment Help:

Tautologies:

Above given table allows us to read the truth of the connectives in the next manner. Just expect we are looking at row three. It means this says that, if there P is false and Q is true, so 

1843_tautologies.png

Specified there that, if P is false, so regardless of where Q is true or false, and the statement P→Q is true. Thus this takes a little getting needed to, to be a very important tool in theorem proving: if there we know that there is something false, than it can imply anything we want it to! Just,, the follow next sentence is true: like "Barack Obama is female" it really implies that "Barack Obama is an alien", it means it the premise that Barack Obama is female was false, now the conclusion is Barack Obama is an alien can be deduced in a sound way. 

Each of row in a truth table describe the connectives are a particular assignment of true and false to the individual propositions in a sentence. So than we identify each assignment a model like: whenever it represents a particular possible state of the world. So, just for two propositions P and Q there are four models. 

Hence, for propositional sentences in generally, there a model is also just a particular assignment of truth values to its individual propositions. If there a sentence with n propositions will have 2n possible models than 2n rows in its truth table. But a sentence S will be true or may false for a given model M - where S is true we say 'M is a model of S'. 

Such type of sentences that are always true, regardless of the truth of the individual propositions are known as tautologies or can say valid sentences. There Tautologies are true for all models. Just like for instance, if I said that the "Tony Blair is prime minister or can say like Tony Blair is not prime minister" so there this is largely a content-free sentence it means that we could have replaced the predicate of being Tony Blair with any predicate so the sentence would still have been correct.


Related Discussions:- Tautologies

Renaming columns - sql, Renaming Columns - SQL SQL has no direct count...

Renaming Columns - SQL SQL has no direct counterpart of RENAME. To derive the table on the right in Figure 4.4 from the table on the left, Tutorial D has IS_CALLED RENAME ( St

Negation - sql, Negation (NOT, ¬) - SQL There are three rows instead o...

Negation (NOT, ¬) - SQL There are three rows instead of just two. As you can see, ¬ p is defined as in two-valued logic (2VL) when p is either true or false, but ¬ (unknown) i

Goto statement - sequential control, GOTO Statement The GOTO statement b...

GOTO Statement The GOTO statement branches to a label unconditionally. The label must be exclusive within its scope and should precede an executable statement or a PL/SQL block.

Query optimization, 1.( /5 marks) Suppose that a B+-tree index with the sea...

1.( /5 marks) Suppose that a B+-tree index with the search key (dept_name, building) is available on relation department. What would be the best way to handle the following selecti

Write a program, to write a heap sort program usin pl-sql

to write a heap sort program usin pl-sql

PROCEDURE, Create a procedure named DDPROJ_SP that retrieves project inform...

Create a procedure named DDPROJ_SP that retrieves project information for a specific project based on a project ID. The procedure should have two parameters: one to accept a projec

Package dbms pipe in pl/sql, DBMS_PIPE: The Package DBMS_PIPE allows va...

DBMS_PIPE: The Package DBMS_PIPE allows various sessions to communicate over the named pipes. (A pipe is a region of memory used by one of the process to pass information to

Using rename in combination with join - sql, Using RENAME in combination wi...

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

Deriving predicates from predicates in sql, Deriving Predicates from Predic...

Deriving Predicates from Predicates in SQL The corresponding section in the theory book describes how predicates can be derived from predicates using (a) the logical connectiv

Row counterparts of table operators - sql, Row Counterparts of Table Operat...

Row Counterparts of Table Operators SQL does not have counterparts tuple rename, tuple projection, tuple extension, tuple join and tuple compose. To obtain the same effects as

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd