Probleme Tema

grupa 212 va rezolva doar subpunctul cu numrul 2,

grupa 213 va rezolva doar subpunctul cu numrul 3,
grupa 215 va rezolva doar subpunctul cu numrul 5,
grupa 216 va rezolva doar subpunctul cu numrul 6, iar
grupa 217 va rezolva doar subpunctul cu numrul 7 din urmtoarele probleme:

Probleme Propoziii
Problema 9.1.1
Folosind metoda tabelelor de adevr verificai:
1.

2.

dac se poate aplica o lege a lui DeMorgan pentru conectiva

( p q ) p q ;

dac conectiva este asociativ: p ( q r ) ( p q) r ;

5. proprietatea de absorbie a conectivei fa de conectiva :
p ( p q) p ;
6. dac conectiva este distributiv fa de conectiva :
p ( q r ) ( p q) ( p r ) ;
3.
4.

7.
.

dac conectiva este distributiv fa de conectiva :

p ( q r ) ( p q) ( p r ) .

Problema 9.1.2
Utiliznd metoda tabelelor de adevr decidei tipul (consistent, inconsistent, tautologie,
contingent) formulei A:
1.
2. A p ( q r ) p q r ;
3. A p ( q r ) p q r ;
4.
5. A ( p q) r p q r ;
6. A p (q r ) q p ;
7. A p ( q r ) q p .
8.
Dac formula A este contingent, scriei toate modelele lui A, sau anti-modelele sale, dac
;

sunt mai puine dect modelele.

Problema 9.1.3
Demonstrai c are loc urmtoarea relaie de consecin logic:
1.

2. p q | ( r p ) ( r q ) ;
3. p q | ( p r ) ( p q r ) ;
5. p q | ( q r ) ( p q r ) ;
6. p r | ( q r ) (( p q) r ) ;
7. p ( q r ) | ( p q) ( p r ) .
4.

8.

folosind metoda tabelelor de adevr.

Problema 9.1.4
Demonstrai c formula urmtoare este tautologie utiliznd metoda tabelelor de adevr.
1.

2. ( p ( q r )) (( p q ) ( p r )) ,

semidistributivitatea la stnga a conectivei fa de ;

3. ( p ( q r )) (( p q) ( q r )) ,

semidistributivitatea la stnga a conectivei fa de ;

5. p ( q r ) (( p q) ( p r )) , semidistributivitatea la stnga a conectivei fa de

4.

6. ( p q r ) ( p ( q r )) , legea separrii premiselor;

7. ( p ( q r )) ( p q r ) , legea reunirii premiselor.
8.

Problema 9.1.6
Aducei la FNC (forma normal conjunctiv) i FND (forma normal disjunctiv):
1.
2.
3.
4.
5.
6.
7.
8.

semidistributivitatea disjunciei fa de implicaie: U (V Z ) ((U V ) (U Z )) ;

legea permutrii premiselor: (U (V Z )) (V (U Z )) ;
;

regula silogismului: (U V ) (V Z ) (U Z ) ;
axioma a doua a calcului propoziional: (U (V Z )) ((U V ) (U Z )) ;
teorema de tiere: (U V ) (U V Z ) (U Z ) .
.

Folosind una din aceste forme normale, demonstrai c aceast lege sau proprietate este o
formul valid n calculul propoziional.

Problema 9.1.7
Utiliznd forma normal adecvat (FNC sau FND) demonstrai:
1.
2.
3.
4.
5.
6.
7.
8.

| (U V ) ((V Z ) (U V Z )) ;
| (U (V Z )) ((U V ) (U Z )) ;
;

| (U V ) (( Z U ) ( Z U V )) ;
| (U V ) ((U Z ) (U (V Z )) ;
| (U Z ) ((V Z ) (U V Z )) .
.

Problema 9.1.8
Utiliznd forma normal adecvat scriei toate modelele formulei:
2. (p q) r p ( q r ) ;
3. ( p q r ) ( p r ) q ;
5. p ( q r ) p q r ;
1.

4.

6. ( p q r ) ( q r ) p ;
7. ( q r p ) ( p r ) q ;
8.

Problema 9.1.9.
Demonstrai c urmtoarele formule sunt inconsistente folosind forma normal adecvat:
2. (U V ) (V U ) ;
3. (U V ) (U V Z ) (U Z ) ;
5. U (V Z ) ((U V ) (U Z )) ;
6. (U (V Z )) (U V Z ) ;
7. (U (V Z )) (V (U Z )) .
1.

4.

8.

Problema 9.1.11.
Folosind definiia deduciei s se demonstreze c au loc deduciile:
1.
2. p r, p r q, r | q ;
3. p q, q r, p | r ;
4.
5. p ( q r ), q, p | r ;
6. p ( q r ), p q, p | r ;
7. p ( q r ), p q, p | r .
8.
;

Problema 9.1.14.
Folosind metoda tabelelor semantice (construcia arborelui binar) decidei tipul formulei A.
Dac A este consistent, scriei toate modelele sale:
9.
A ( p q r) ( p r) q ;
2.
A ( p q r) ( p r) q ;
3.
A (( r q) ( p r )) ( p q ) ;
5.
A (( r q ) (p r )) ( p q ) ;
6.
A
(q r p) ( p r) q .
7.
1.

4.

8.

Problema 9.1.15.
Demonstrai c formula A este o tautologie folosind metoda tabelelor semantice (construcia
arborelui binar):
A ( p q r ) ( p ( q r )) legea separrii premiselor;
2.
A ( p q r ) ( p q) ( p r ) distributivitatea fa de ;
3.
A ( p ( q r )) ( p q r ) legea reunirii premiselor;
5.
A ( p q) (( r t ) ( p r q t )) ;
6.
A ( p q r ) ( p q) ( p r ) distributivitatea fa de .
7.
1.

4.

8.

Problema 9.1.16.
Folosind metoda tabelelor semantice (construcia arborelui binar) demonstrai c au loc
relaiile de consecin logic:
2. p ( q r ), r q | ( p q) r ;
3. p (q r ), r q | (p q) r ;
5. p r, q t , p q | r t ;
6. p q, r t , p r | q t ;
7. p ( q r s ), p, r | q .
1.

4.

8.

Problema 9.1.17.
Folosind calculul secvenelor verificai dac secvenele urmtoare sunt adevrate:
2. q r p, q ( p r ) q ;
3. p q r ( p r ) q ;
5. p, p q r ( p r ) q ;
6. p, r q p r ( p q ) ( q p ) ;
7. q r p, q ( p r ) q .
4.

8.

Problema 9.1.18.
Utiliznd calculul secvenelor verificai validitatea formulei A:
2. A ( p q) ( p q r ) ( p r ) teorema de tiere;
3. A ( p ( q r )) ( p q r ) legea reunirii i a separrii premiselor;
5. A ( p ( q r )) ( q ( p r )) legea permutrii premiselor;
6. distributivitatea la stnga a conectivei fa de :
A ( p q r ) ( p q) ( p r ) ;
7. distributivitatea la stnga a conectivei fa de :
A p ( q r ) ( p q) ( p r ) ;.
4.

8.

Problema 9.1.19.
Folosind calculul secvenelor verificai dac au loc relaiile:
2. p ( q r ), q r | p ( q r ) ;
3. p ( q r ), q r | p ( q r ) ;
5. p ( q r s ), p, r | q r ;
6. p (q r s ), p, s | q s ;
7. p q, r t , p r | q t .
1.

4.

8.

Problema 9.1.22.
Folosind rezoluia general demonstrai c formulele urmtoare sunt tautologii:
2. ( B A) (C A) ( B C A) ;
3. ( B A) (C A) ( B C A) ;
5. A ( B C ) ( A B) ( A C ) ;
6. ( A B ) ((C A) (C B )) ;
7. ( A B ) ((A C ) (B C )) .
4.

8.

Problema 9.1.23.
Demonstrai inconsistena urmtoarelor mulimi de clauze folosind rezoluia blocrii. Alegei
dou indexri diferite pentru literalii din clauze.
2. {p q,p q r,p r, p r,p r} ;
3. { p q, p q r , p r, r , p r} ;
5. { p q, p q r, p q r, p q, r} ;
6. { p q, p q r, p q r, p q, r} ;
7. { p q, p q r, p q r, r q, r q} .
4.

8.

Problema 9.1.24.
Construii o respingere liniar din mulimea de clauze S. Exist respingeri input i unit din
S?
2. S { p r, q r, q r, p r} ;
3. S {q r, p, q r, p r} ;
4.
;

5. S { p r, q, p q r, p r, q r} ;
6. S { p q, p q, p q, p q} ;
7. S { p, q r, p q r , p q} .
8.
.

Problema 9.1.25.
Utiliznd strategia mulimii suport demonstrai c au loc urmtoarele deducii:
2. p r , q r , q | ( p q) ;
3. q r p, p q, q r | p ;
5. p q, (q r ) r | p r ;
6. q p, q r , p r | r ;
7. p q r , q, p q | ( p q) r .
4.

8.

Problema 9.2.6.
Construii toate formele normale prenexe, Skolem i clauzale ale urmtoarelor formule:
2. (y ) ((x)r ( x ) (x)(q ( y ) p ( x))) ;
3. (y ) ((x ) p ( x ) (z )(q ( z ) r ( y ))) ;
4.
5. (z ) ((y ) p( y ) (x )(r ( z ) q ( x))) ;
6. (x) ((y )r ( y ) (y )(q ( y ) p ( x ))) ;
7. (z ) ((y ) p ( y ) (y )(q ( z ) r ( y ))) .
8.
;

Problema 9.2.7.
Aducei la o form normal prenex i la o form normal clauzal urmtoarele formule:
2. (y )(z )((x )p ( x ) (u )(q ( y , u ) (x )q ( x, z ))) ;
3. (x)(y )((z ) p ( z ) (u )(q ( x, u ) (z )q ( y, z ))) ;
5. (z )(y )((x ) p ( x) (u )(q ( z , u ) (x) q ( y , x))) ;
6. (x )(y )((z ) p ( z ) (u )(q ( x, u ) (z ) q ( y , z ))) ;
7. (x)(y )((z )p ( z ) (u )(q ( x, u ) (z ) q( y, z ))) .
4.

8.

Problema 9.2.8.
Sunt unificabili atomii din perechile urmtoare? Dac da, aflai cel mai general unificator al
acestora. Prin convenie: a,b,c sunt constante, x,y,z,u sunt variabile, iar f,g,h sunt simboluri
de funcii.
2. P ( a , x, f ( g ( y ))) i P ( y , f ( z ), f ( z )) ;
P ( x , g ( f ( a )), f (b)) i P ( f ( y ), z , z ) ;
P ( a , x, f ( g ( y ))) i P( z , h ( z , u ), f (b), z ) ;
3. P ( a , f ( x ), g ( h( y ))) i P ( y , f ( z ), g ( z )) ;
P ( x, g ( f ( a )), h ( x, y )) i P ( f ( z ), g ( z ), y ) ;
P ( g ( y ), x , f ( g ( y ))) i P ( z, h ( z , u ), f (u )) ;
4.

5. P ( a , x, g ( f ( y ))) i P ( f ( z ), z , g ( x )) ;
P ( a , x, g ( f ( y ))) i P ( x , y , g ( f (b))) ;
P (a, h( x, u ), g ( z )) i P ( y , h ( y , f ( z )), g ( x )) ;
6. P ( a , y , g ( f ( z ))) i P ( z, f ( z ), x ) ;
P ( y , f ( x ), z ) i P ( y , f ( y ), f ( y )) ;
P ( h ( x, y ), x, y ) i P ( h ( y , x ), f ( z ), z ) ;

7. P ( a , x, g ( f ( y ))) i P ( f ( y ), z , x ) ;
P ( x, a , g (b)) i P( f ( y ), f ( y ), g ( x )) ;
P ( h ( x, a ), f ( z ), z ) i P ( h( y , x ), f ( x ), a ) .
8.

Problema 9.2.11.
Utiliznd metoda calculului secvenelor, verificai:
2. semidistributivitatea cuantificatorului fa de :
| (x ) p ( x ) (x ) q( x ) (x )( p ( x ) q( x )) ;
Artai c implicaia invers nu are loc.
3. distributivitatea cuantificatorului fa de :
| ( x )( p( x ) q( x )) ( x ) p ( x ) (x ) q( x ) ;
4.
5. semidistributivitatea cuantificatorului fa de :
;

| (x )( p ( x ) q ( x )) ((x ) p ( x ) (x ) q ( x ))

Artai c implicaia invers nu are loc.

6. semidistributivitatea cuantificatorului fa de :
| ((x ) p ( x ) (x ) q( x )) (x )( p ( x ) q( x ))

Artai c implicaia invers nu are loc.

7. | (x ) p ( x ) (x )( p ( x ) q( x )) (x ) p ( x ) .
8.

Problema 9.2.12.
Utiliznd calculul secvenelor, verificai dac au loc deduciile:
2. (x )( p( x ) q( x )), (x ) p( x ) | (x ) q( x ) ;
3. (x )(y )( q( x, y ) p ( x, y )), (z ) q( z , z ) | (x ) p ( x, x ) ;
4.
5. (x )( p ( x ) q( x )), (x ) p ( x ) | ( x ) q( x ) ;
6. (x )(y )( q( x , y ) p ( x, y )), (z ) q( z, z ) | ( x ) p ( x, x ) ;
7. (x )(y )( p ( x, y ) r ( x )), (x )( y ) p ( x, y ) | (z ) r ( z ) .
8.
;

Problema 9.2.13.
Utiliznd metoda tabelelor semantice (construind arborele binar i/sau funcia TP),
demonstrai:
2. distributivitatea cuantificatorului fa de :
| (x ) p ( x ) (x ) q( x ) (x )( p( x ) q( x )) ;
3. semidistributivitatea cuantificatorului fa de :
| (x )( p ( x ) q( x )) ((x ) p ( x ) (x ) q( x )) ;
Artai c implicaia invers nu are loc.
4.
5. semidistributivitatea cuantificatorului fa de :
| (x ) p ( x ) (x ) q( x ) (x )( p ( x ) q( x )) ;
Artai c implicaia invers nu are loc.
6. | (x ) p ( x ) ((x ) p ( x ) (x ) q( x )) (x ) p ( x ) ;
7. | (x ) p( x ) (x )( p( x ) q( x )) (x ) p( x ) .
8.
;

Problema 9.2.14.
Utiliznd metoda tabelelor semantice (construind arborele binar i/sau funcia TP), verificai
dac au loc:
1.
2. | ( x )(y ) p ( x , y ) (y )(x ) p ( x , y ) ;
3. | (y )( x ) p ( x, y ) ( y )( x ) p ( x, y ) ;
4.
5. | (y )(x ) p ( x, y ) (x )(y ) p( x, y ) ;
6. | (y )( x ) p ( x, y ) ( x )(y ) p ( x, y ) ;
7. | (y )( x ) p ( x, y ) (x )( y ) p ( x, y ) .
8.
;

Problema 9.2.15.
Demonstrai inconsistena urmtoarelor mulimi de clauze utiliznd rezoluia blocrii. Utilizai
dou indexri diferite pentru literalii din clauze.
2. S { p ( x ) q ( x), p ( a) r ( x), q( x ), w( z ), r ( y ) w( y ) } ;
3. S { p ( x ) q ( x ) r ( x ), p (b), q ( x ), w(b), r ( y ) w( y ) } ;
4.

5. S { p ( x ) q( x ), p ( a ) w( x ), q( y ) r ( y ), r ( x ) w( x ), w( a ) } ;

S { p(x) q(x), p(z) w(x), q( y) w( y) r( y),

6.

r( x ) w( x ), r( g( a,b )) } ;
S { p ( x) q ( x), p ( x), q ( f ( a )) r ( z ), w( z ), r ( y ) w( y ) } .

7.
8. .

Problema 9.2.16.
Verificai dac urmtoarele formule sunt teoreme utiliznd rezoluia general:
2. (x)(y )(( p( x, y ) p ( y, x)) (x) p( x, x ) ;
3. ((x) p ( x) (x)q ( x)) (x)( p ( x) q ( x)) ;
4.

p ( a ) (x )( p ( x ) p ( f ( x))) (x ) p ( x )

5.
6.
7.
8.

(x )(y )(q ( x, y ) p ( x, y )) ((z ) q ( z , z ) (x) p ( x, x)) ;

((x ) p ( x ) (x ) q ( x )) (x )( p ( x ) q ( x )) .
.

Problema 9.2.17.
Verificai dac se poate obine concluzia pornind de la ipoteze, prin utilizarea rezoluiei cu
strategia input, clauza vrf fiind negativ:
2. (x )(y )( p( x, y ) r ( x )), (x )(y ) p( x, y ) | (z ) r ( z ) ;
3. (x ) p ( a , x , x ), (x )(y )(h )(t )( p (t , x , y ) p ( f ( h, t ), x , f ( h, y )) )
| p ( f ( 2, a ), f (3, a ), f ( 2, f ( 3, a ))) ;
4.

5. (x )(p ( x ) q( x ) r ( x )), (y )( r ( y ) w( y )), (x )( w( x ) p( x )),

p ( a ), p (b), w( c ) | (z ) q( z ) ;

6. (x )( p( x ) r ( x )), (y )( r ( y ) q( y )), r ( a ), r (b), r ( c ) | (z ) q( z ) ;

7. (x )( p ( x ) r ( x )), (y )( p ( y ) q( y )), p ( a ), p (b), p ( c ) | (z ) q( z ) .
8.
.

Problema 9.2.18.
S se demonstreze deduciile urmtoare utiliznd metoda rezoluiei i s se identifice toate
modurile de obinere a clauzei vide:
2. ( x )( p( x ) r( x )),( y )( r( y ) q( y )), p( a ), p( b ) | ( z )q( z ) .
3. (x )(p ( x ) q( x ) r ( x )), (y )( r ( y ) w( y )), (x )( w( x ) p( x )),
p ( a ), p (b), w( c ) | (z ) q( z )
;
4.
5. ( x )( p( x ) q( x ) r( x )),( y )( r( y ) w( y )),( x )( w( x ) p( x )),
p( a ), w( c ) | ( z )q( z ) ;
6. ( x )( y )( p( y , x ) q( y )),( x )( y )( r( y , x ) q( x ) q( y )),
r( b , a ), p( a , b ) | ( z )q( z ) ;
7. ( x )( p( x ) r( x )),( y )( p( y ) q( y )), p( a ), r( c ) | ( z )q( z ) .
8.
;

Problema 9.2.19.
Utiliznd rezoluia liniar, demonstrai:
2. semidistributivitatea cuantificatorului fa de :
| (x )( p ( x ) q( x )) (x ) p( x ) (x ) q( x ) ;
Artai c implicaia invers nu are loc.
3. | (x )( p( x ) q( x )) ((x ) p( x ) (x ) q( x )) ;
4.

5. | (x ) p( x ) (x )( p( x ) q( x )) (x ) p( x ) ;
6. semidistributivitatea cuantificatorului fa de :
| (x )( p ( x ) q( x )) ((x ) p ( x ) (x ) q ( x )) ;
Artai c implicaia invers nu are loc.
7. | (x ) p ( x ) ((x ) p ( x ) (x ) q( x )) (x ) p ( x ) .
8.

Problema 9.2.20.
Verificai urmtoarele echivalene utiliznd o strategie/rafinare a rezoluiei predicative:
2. (y )(x ) p( x, y ) (x )( y ) p ( x, y ) ;
3. (x )(y ) p ( x, y ) (x )(y ) p( x, y ) ;
4.

5. (y )(x ) p ( x, y ) (x )(y ) p ( x, y ) ;
6. (y )(x ) p ( x, y ) (x )(y ) p( x, y ) ;
7. (y )(x ) p ( x, y ) ( x )(y ) p ( x, y ) .
8.

Problema 9.2.21.
Utiliznd rezoluia general, verificai dac formulele urmtoare sunt sau nu sunt teoreme:
2. (x )(y )( p( x, y ) p( y , y )) ;

3. (x )(y )( p( y , y ) p( x, y )) ;
4.

5. (y )(x ) p ( x, y ) (x )(y ) p ( x, y ) ;
6. (y )(x ) p ( x, y ) (x )(y ) p ( x, y ) ;
7. (y )(x ) p ( x, y ) (x )(y ) p( x, y ) .
8.

Problema 9.3.1.
Pentru urmtoarele funcii booleene de trei variabile, date prin intermediul tabelelor de
valori, scriei cele dou forme canonice: conjunctiv (FCC) i disjunctiv (FCD).
Simplificai funciile utiliznd diagrame Veitch.
x
0
0
0
0
1
1
1
1

y
0
0
1
1
0
0
1
1

z
0
1
0
1
0
1
0
1

f2
0
1
0
0
1
1
0
1

f3
1
1
1
0
1
0
0
0

f5
0
1
1
0
0
1
1
0

f6
1
0
1
1
0
0
1
0

f7
0
0
1
0
1
1
0
1

Problema 9.3.2.
Simplificai urmtoarele funcii booleene de patru variabile, date prin formele canonice
disjunctive, utiliznd diagrame Veitch:
1.
2. f2(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
3. f3(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
4.
5. f5(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
6. f6(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
7. f7(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
;

Problema 9.3.3.
Simplificai urmtoarele funcii booleene de trei variabile, date prin mintermii expresiilor,
utiliznd diagrame Karnaugh:
1.
2. f2(x1,x2,x3)= m1 m2 m4 m5 m6 m7;
3. f3(x1,x2,x3)= m1 m2 m3 m4 m5 m7;
4.
5. f5(x1,x2,x3)= m0 m1 m2 m4 m6 m7;
6. f6(x1,x2,x3)= m0 m1 m3 m5 m6 m7;
7. f7(x1,x2,x3)= m0 m1 m2 m3 m4 m7;
;

Problema 9.3.4.
Utiliznd metoda lui Quine simplificai urmtoarele funcii booleene de trei variabile:
2. f2(x1,x2,x3)= x3(x1 x2) (x2 x3);
3. f3(x1,x2,x3)= x2(x1 x3) x2x3;
4.

f6(x1,x2,x3)= x2(x1 x3) (x1 x2);

6.

5.

f5(x1,x2,x3)= x3(x1 x2) x1x3;

7.

f7(x1,x2,x3)= x2(x1 x3) x1x2;

Problema 9.3.5.
Simplificai urmtoarele funcii booleene de patru variabile date prin valorile de 1, utiliznd
metoda lui Quine:
1.
2. f2(1,1,0,1)=1, f2(0,1,0,1)=1, f2(0,1,0,0)=1, f2(0,0,0,0)=1, f2(0,0,1,0)=1, f2(1,0,1,1)=1,
f2(1,0,0,1)=1, f2(0,0,1,1)=1;
3. f3(0,1,0,1)=1, f3(0,1,0,0)=1, f3(0,1,1,0)=1, f3(1,0,1,0)=1, f3(1,0,0,0)=1, f3(0,0,1,0)=1,
f3(1,0,0,1)=1, f3(0,0,0,1)=1;
4.
5. f5(1,1,1,1)=1, f5(0,1,0,1)=1, f5(0,1,1,1)=1, f5(1,1,1,0)=1, f5(1,1,0,0)=1, f5(1,0,0,0)=1,
f5(1,0,0,1)=1, f5(0,0,0,1)=1;
6. f6(1,1,0,1)=1, f6(0,1,0,1)=1, f6(0,1,1,1)=1, f6(1,1,1,0)=1, f6(0,1,1,0)=1, f6(1,0,1,0)=1,
f6(1,0,1,1)=1, f6(1,0,0,1)=1;
7. f7(1,1,1,1)=1, f7(1,1,0,1)=1, f7(0,1,0,1)=1, f7(0,1,0,0)=1, f7(0,1,1,0)=1, f7(0,0,1,0)=1,
f7(1,0,1,1)=1, f7(0,0,1,1)=1;
;

Problema 9.3.8.
Desenai circuitul logic asociat funciei booleene de mai jos, simplificai funcia i desenai
circuitele logice corespunztoare tuturor formelor simplificate ale funciei, utiliznd doar
pori de baz:
2. f 2(x,y,z)= x (y z) x (y z) y (x z);
3. f 3(x,y,z)= x (y z) y (x z) x (y z) (x y) z;
4.
5. f 5(x,y,z)= x (y z) y (x z) x (y z) (x y) z;
6. f 6(x,y,z)= x (y z) x (y z) y (x z);
;

7. f 7(x,y,z)= x (y z) y (x z) x (y z) (x y) z;

Problema 9.3.9.
Desenai un circuit logic avnd trei variabile de intrare i coninnd toate porile de baz i
derivate. Scriei funcia boolean corespunztoare i simplificai-o, iar apoi desenai un circuit
logic simplificat.

10