O'Reilly logo

Formal Languages and Automata Theory by K.V.N. Sunitha

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Appendix A

PROPOSITION AND PREDICATE LOGIC

In this chapter, we introduce proposition and logical connectives. Normal forms for well-formed formulas are given. Introduction to predicates and rules of inference for propositional calculus and predicate calculus is given.

A.1  Propositions

A proposition is a declarative sentence that is either true or false. If the sentence is true then its truth value (Tv) is T, otherwise it is F.

Example:

S1 – Square of 6 is 36.

Tv(S1) = T

⇒ proposition

S2 – Delhi is the capital of America.

Tv(S2) = F

⇒ proposition

S3 – On Friday it will rain.

 

 

(This statement has two possible truth values depending on whether it rains or not on Friday).

Tv(S3) = F

if it does not rain.

Tv(S3) = T

if it ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required