0% found this document useful (0 votes)
2 views5 pages

Zero Order Normal Forms

Uploaded by

sunderiya4
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views5 pages

Zero Order Normal Forms

Uploaded by

sunderiya4
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

University of Debrecen, Faculty of Informatics

Logic in computer science

Zero-order logic
(propositional logic)

normal forms

October 10, 2022


Literal

Let L(0) = hLC ; C o n; F o r mi be a zero-order language.


If p 2 C o n then

• the p and :p formulas are called literals , where

• the p atomic formula is the base of the literal;

• the p literal is a positive literal,

• the :p literal is a negative literal.

2/5
Elementary conjunction, elementary disjunction

An elementary disjunction:

• is a literal, or

• a disjunction of a literal and an elementary disjunction.


` 1 _ `2 _    _ `n where n  1 and ` i are literals for all i = 1; : : : ; n

An elementary conjunction:

• is a literal, or

• a conjunction of a literal and an elementary conjunction.


` 1 ^ `2 ^    ^ `n where n  1 and ` i are literals for all i = 1; : : : ; n

3/5
Normal forms

A disjunctive normal form (DNF):

• is an elementary conjunction, or

• a disjunction of an elementary conjunction and a disjunctive normal form.

e1 _ e2 _    _ en where n  1 and e i is an elementary conjunction for all i = 1; : : : ; n

A conjunctive normal form (CNF):

• is an elementary disjunction, or

• a conjunction of an elementary disjunction and a conjunctive normal form.

e1 ^ e2 ^    ^ en where n  1 and e i is an elementary disjunction for all i = 1; : : : ; n

4/5
Normal form theorem

Let L(0) = hLC ; C o n; F o r mi be a zero-order language and A 2 F o r m be a formula.

1. There exists a formula D 2 F o r m such that


A , D and D is a disjunctive normal form.

2. There exists a formula C 2 F o r m such that


A , C and C is a conjunctive normal form.

The disjunctive normal form of a formula A is a formula in disjunctive normal form


which is semantically equivalent with A.

The conjunctive normal form of a formula A is a formula in conjunctive normal form


which is semantically equivalent with A.

5/5

You might also like