OnProgrammingforCorrectness/16_.tex at master · kammitama5/OnProgrammingforCorrectness · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
\documentclass{article}
\usepackage[utf8]{inputenc}
\usepackage{amsmath}

\author{Krystal Maughan }
\date{May 4th 2017}

\begin{document}

\section{Disjunctive Conjunction}
$\mathbf{Homework 3.3.2.1}$
\\
\\
Pick the predicate that best describes the operation:
\\
1.$ (x \leq 0 \land c = \hat{c} + 1) \vee (x > 0 \land c = \hat{c})$
\\
2.$ (x \leq y \land z = y) \vee (x \geq y \land z = x)$
\\
3.$ (x \leq y \land z = x) \vee (x \geq y \land z = y)$
\\
4.$ (x \geq 0 \land z = x) \vee (x \leq 0 \land z = -x)$
\\
5.$ (x \geq y \land z = x - y) \vee (y \geq x \land z = y - x)$
\\
\\
3.3.2.1-1: $z = abs(x)$
\\
$(x \geq 0 \land z = x) \vee (x \leq 0 \land z = -x)$
\\
\\
3.3.2.1-2: $z = min(x, y)$
\\
$(x \leq y \land z = x) \vee (x \geq y \land z = y)$
\\
\\
3.3.2.1-3: $z = max(x, y)$
\\
$(x \leq y \land z = y) \vee (x \geq y \land z = x)$
\\
\\
3.3.2.1-4: $z = abs(x - y)$
\\
$(x \geq y \land z = x - y) \vee (y \geq x \land z = y - x)$
\\
\\
3.3.2.1-5: Increment $c$ by one if $ x \leq 0$
\\
$(x \leq 0 \land c = \hat{c} + 1) \vee (x > 0 \land c = \hat{c})$

\end{document}