Discrete mathematics_Homework_5_23_Pro_3

Part 1

Set $P$ is a well-formed formulas in propositional logic, involving T,F,s and $\{\neg \to \land \lor \leftrightarrow\}$

Basis Step:

$T,F,s \in P$, where $s$ is a propositional variable, are well-formed formulas.

Recursive Step:

If formulas $A,B \in P$, we have
$(\neg A) \in P, (A \land B) \in P, (A \lor B) \in P, (A \to B) \in P, (A \leftrightarrow B) \in P$

Part 2

$f(x): P \to N$
$f(x) = s$, $s$ is the number of connectives for $x, x \in P$

Part 3

For variables $p,q$, we have

$p$	$q$	$\neg (p \land q)$	$\neg p \lor \neg q$
1	1	0	0
1	0	1	1
0	1	1	1
0	0	1	1

$p$	$q$	$\neg (p \lor q)$	$\neg p \land \neg q$
1	1	0	0
1	0	0	0
0	1	0	0
0	0	1	1

$p,q \in P$, from the recursive definition, we know $\forall A,B \in P$, we holds De Morgan low.

Part 4

Firstly, $*p = \neg p$

$p$	$q$	$\neg p$	$\neg q$
1	1	0	0
1	0	0	1
0	1	1	0
0	0	1	1

From the tabel above, we know that If $p = q$, $*p = *q$
$p,q \in P$, from the recursive definition, we know $\forall A,B \in P$, we holds duality principle.
$If A = B, *A = *B$