$(2)$ Consider a language of propositional logic $(16m$ iii$)$ APply the DPLL algorithm on the formula cormula using only

a$.$ Atomic Propositions given. If it is satisfiable, provide an assignment

b$.$ The atomic value FALSE

c$.$ The ternary operator $M$ is defined as follows:

$M({}_1,{}_2,{}_3)$ is TRUE if and only if the majority $($i$.$e two or more$)$ of ${}_1{}_2$ and ${}_3$ evaluate to FALSE.

Argue that this set of teatures is adequate i$.$e$,$ all propositional formulas can be rewritten using thes

D Define

a$)$ Soundness

b$)$ validity

How many rows would our truth table have f we wish to use truth table to check for the satisfiability of the following:

$(pvvqvvno{t}^r{)}^{{?}^{?}}(notpvvqvvs{)}^{{?}^{?}}(rvvsvvnottvvnotq)$

$(2)$

$($i$)$ Consider a language of propositional log ic $(16$m$)$

Sormula using only

a$.$ Atomic Propositions

b$.$ The atomic value FALSE

c$.$ The ternary operator $M$ is defined as follows:

$M({}_1,{}_2,{}_3)$ is TRUE if and only if the majority $($i$.$e two or more$)$ of ${}_1{}_2$ and ${}_3$ evaluate to FALSE.

Argue that this set of features is adequate i$.$e$,$ all propositional formulas can be rewritten using thes

How many rows would our truth table have f we wish to use truth table to check for the satisfiability of the following:

$(pvvqvvnotr{)}^{{?}^{?}}(notpvvqvvs{)}^{{?}^{?}}(rvvsvvnottvvnotq)$

iii$)$ Apply the DPLL algonthm on the formula given. If it is satisfiable, provide an assignment such that exactly one literal is set to true.

smanl $v$

tupe this in chasg or

otter.ai

Define

a$)$ Soundness

b$.)$ validity