Skip to content
Snippets Groups Projects
Commit c38145f4 authored by Daniel Shchur's avatar Daniel Shchur
Browse files

init

parents
Branches
No related tags found
No related merge requests found
Expand all Show whitespace changes
Inline Side-by-side
Showing
with 785 additions and 0 deletions
hw01/HW01DanielShchur.pdf 0 → 100755
+ 0
− 0
View file @ c38145f4
File added
hw01/HW01DanielShchur.tex 0 → 100644
+ 235
− 0
View file @ c38145f4
\documentclass[12pt,letterpaper]{article}
\usepackage{caption}
\usepackage[table]{xcolor}
\usepackage{boldline}
\usepackage{geometry}
\usepackage{marginnote}
\usepackage{bm}
\newcommand{\problem}{\vspace{.5cm}\textbf{Problem:~~}}
\newcommand{\answer}{\emph{Answer:~~}}
\setlength{\parindent}{0pt}
\setlength{\parskip}{0cm}
\title{CSCE 235H Homework 01}
\author{Daniel Shchur}
\begin{document}
\maketitle
\section{Book Work}
\problem (Pg12 S1.1 \#2) Which of these sentences are propositions? What are the truth values of those that are propositions?
\begin{enumerate}
\item[a)] Do not pass go.
\begin{enumerate}
\item[] \answer It is not a proposition (it's a command).
\end{enumerate}
\item[b)] What time is it?
\begin{enumerate}
\item[] \answer It is not a proposition (it's a question).
\end{enumerate}
\item[c)] There are no black flies in Maine.
\begin{enumerate}
\item[] \answer It is a false proposition assuming black flies have not gone \mbox{extinct}.
\end{enumerate}
\item[d)] $4 + 4 = 5$.
\begin{enumerate}
\item[] \answer It is not a proposition (contains a variable).
\end{enumerate}
\item[e)] The moon is made of green cheese.
\begin{enumerate}
\item[] \answer It is a false proposition because the moon is most certainly not made of cheese nor is it green (although the former is true for Wallace and Gromit).
\end{enumerate}
\item[f)] $2^n \geq 100$.
\begin{enumerate}
\item[] \answer It is not a proposition (contains a variable).
\end{enumerate}
\end{enumerate}
\newpage
\problem (Pg13 S1.1 \#14) Let $p$, $q$, and $r$ be the propositions\\
\indent\hspace{0.75cm} $p$: You get an A on the final Exam.\\
\indent\hspace{0.75cm} $q$: You do every exercise in this book.\\
\indent\hspace{0.75cm} $r$: You get an A in this class.\\
Write these propositions using $p$, $q$, and $r$ and logical connectives (including negations).
\begin{enumerate}
\item[a)] You get an A in this class, but you do not do every exercise in this book
\begin{enumerate}
\item[] \answer $r \wedge \neg q$
\end{enumerate}
\item[b)] You get an A on the final, you do every exercise in this book, and you get an A in this class.
\begin{enumerate}
\item[] \answer $p \wedge q \wedge r$
\end{enumerate}
\item[c)] To get an A in this class, it is necessary for you to get an A on the final.
\begin{enumerate}
\item[] \answer $p \rightarrow r$
\end{enumerate}
\item[d)] You get an A on the final, but you don't do every exercise in this book; nevertheless, you get an A in this class.
\begin{enumerate}
\item[] \answer $p \wedge \neg q \wedge r$
\end{enumerate}
\item[e)] Getting an A on the final and doing every exercise in this book is sufficient for getting an A in this class.
\begin{enumerate}
\item[] \answer $(p \wedge q) \rightarrow r$
\end{enumerate}
\item[f)] You will get an A in this class if and only if you either do every exercise in this book or you get an A on the final.
\begin{enumerate}
\item[] \answer $(p \vee q) \leftrightarrow r$
\end{enumerate}
\end{enumerate}
\newpage
\problem (Pg14 S1.1 \#18) Determine whether each of these conditional statements is true or false.
\begin{enumerate}
\item[a)] If $1+1=3$, then unicorns exist.
\begin{enumerate}
\item[] \answer True
\end{enumerate}
\item[b)] If $1+1=3$, then dogs can fly.
\begin{enumerate}
\item[] \answer True
\end{enumerate}
\item[c)] If $1+1=2$, then dogs can fly.
\begin{enumerate}
\item[] \answer False
\end{enumerate}
\item[d)] If $2+2=4$, then $1+2=3$.
\begin{enumerate}
\item[] \answer True
\end{enumerate}
\end{enumerate}
\newpage
\problem (Pg15 S1.1 \#38) Construct a truth table for $((p \rightarrow q) \rightarrow r) \rightarrow s$.
\indent\hspace{0.5cm}\answer
\begin{table}[htb]
\caption*{Problem \#38}
\begin{center}
\rowcolors{2}{lightgray}{white}
\begin{tabular}{V{3} c | c | c | c V{3} c | c | c V{3}}
\hlineB{3}
$p$ & $q$ & $r$ & $s$ & $p \rightarrow q$ & $(p \rightarrow q) \rightarrow r$ & $((p \rightarrow q) \rightarrow r) \rightarrow s$\\
\hlineB{3}
0 & 0 & 0 & 0 & 1 & 0 & 1\\
\hline
1 & 0 & 0 & 0 & 0 & 1 & 0\\
\hline
0 & 1 & 0 & 0 & 1 & 0 & 1\\
\hline
0 & 0 & 1 & 0 & 1 & 1 & 0\\
\hline
0 & 0 & 0 & 1 & 1 & 0 & 1\\
\hline
1 & 1 & 0 & 0 & 1 & 0 & 1\\
\hline
1 & 0 & 1 & 0 & 0 & 1 & 0\\
\hline
1 & 0 & 0 & 1 & 0 & 1 & 1\\
\hline
0 & 1 & 1 & 0 & 1 & 1 & 0\\
\hline
0 & 1 & 0 & 1 & 1 & 0 & 1\\
\hline
0 & 0 & 1 & 1 & 1 & 1 & 1\\
\hline
1 & 1 & 1 & 0 & 1 & 1 & 0\\
\hline
1 & 1 & 0 & 1 & 1 & 0 & 1\\
\hline
1 & 0 & 1 & 1 & 0 & 1 & 1\\
\hline
0 & 1 & 1 & 1 & 1 & 1 & 1\\
\hline
1 & 1 & 1 & 1 & 1 & 1 & 1\\
\hlineB{3}
\end{tabular}
\end{center}
\end{table}
\newpage
\newgeometry{left=1.9in, right=1in}
\reversemarginpar
\marginparwidth=1in
\section{Problem A}
\marginnote{\color{cyan} \textbf{Example 11}}
Construct the truth table of the compound proposition
\vspace{0.5cm}
\indent\hspace{0.5cm}$(p \vee \neg q) \rightarrow (p \wedge q)$
\vspace{0.5cm}
\color{cyan}\emph{Solution: }\color{black}Because this truth table involves two propositional variables $p$ and $q$, there are four rows in this truth table, one for each of the pairs of truth values TT, TF, FT, and FF. The first two columns are used for the truth values of p and q, respectively. In the third column we find the truth value of $\neg q$, needed to find the truth value of $p \vee \neg q$, found in the fourth column. The fifth column gives the truth value of $p \wedge q$. Finally, the truth value of $(p \vee \neg q) \rightarrow (p \wedge q)$ is found in the last column. The resulting truth table is shown in Table 7.
\begin{table}[htb]
\setlength{\tabcolsep}{11pt}
\renewcommand{\arraystretch}{1.5}
\arrayrulecolor{cyan}
\arrayrulewidth=.75pt
\begin{tabular}{|c c|c|c|c|c|}
\hline
\rowcolor{cyan!13}\multicolumn{6}{|l|}{\color{cyan} \begin{large}\textbf{TABLE 7} \end{large} \color{black} \textbf{The Truth Table of} \bm{$(p \vee \neg q) \rightarrow (p \wedge q).$}}\\
\hline
\bm{$p$} & \bm{$q$} & \bm{$\neg q$} & \bm{$p \vee \neg q$} & \bm{$p \wedge q$} & \bm{$(p \vee \neg q) \rightarrow (p \wedge q)$}\\
\hline
T & T & F & T & T & T\\
T & F & T & T & F & F\\
F & T & F & F & F & T\\
F & F & T & T & F & F\\
\hline
\end{tabular}
\end{table}
\end{document}
\ No newline at end of file
hw02/HW02DanielShchur.pdf 0 → 100755
+ 0
− 0
View file @ c38145f4
File added
hw02/HW02DanielShchur.tex 0 → 100644
+ 0
− 0
View file @ c38145f4
This diff is collapsed.
hw03/HW03DanielShchur.aux 0 → 100755
+ 1
− 0
View file @ c38145f4
\relax
hw03/HW03DanielShchur.log 0 → 100755
+ 0
− 0
View file @ c38145f4
This diff is collapsed.
hw03/HW03DanielShchur.pdf 0 → 100755
+ 0
− 0
View file @ c38145f4
File added
hw03/HW03DanielShchur.tex 0 → 100644
+ 333
− 0
View file @ c38145f4
\documentclass[12pt,letterpaper]{article}
\usepackage{bm}
\usepackage{forest}
\usepackage[letterpaper, margin=.75in]{geometry}
\newcommand{\problem}{\vspace{.5cm}\textbf{Problem:~~}}
\newcommand{\answer}{\emph{Answer:~~}}
\newcommand{\ansindent}{\indent\hspace{0.5cm}}
\newcommand{\answerindent}{\hangindent=.5cm\hangafter=0\answer}
\newcommand{\ansend}{\vspace{0.25cm}\\}
\setlength{\parindent}{0pt}
\setlength{\parskip}{0cm}
\setlength{\intextsep}{.25cm}
\title{CSCE 235H Homework 03}
\author{Daniel Shchur}
\begin{document}
\maketitle
\problem (\#10 S1.4 Pg53) Let $C(x)$ be the statement ``$x$ has a cat,'' let $D(x)$ be the statement ``$x$ has a dog,'' and let $F(x)$ be the statement ``$x$ has a ferret.'' Express each of these statements in terms of $C(x), D(x), F(x)$, quantifiers, and logical connectives. Let the domain consist of all students in your class.
\begin{enumerate}
\item[a)]A student in your class has a cat, a dog, and a ferret.
\begin{enumerate}
\item[]\answer $\exists x (C(x) \wedge D(x) \wedge F(x))$
\end{enumerate}
\item[b)]All students in your class have a cat, a dog, or a ferret.
\begin{enumerate}
\item[]\answer $\forall x (C(x) \wedge D(x) \wedge F(x))$
\end{enumerate}
\item[c)]Some student in your class has a cat and a ferret, but not a dog.
\begin{enumerate}
\item[]\answer $\exists x (C(x) \wedge F(x) \wedge \neg D(x))$
\end{enumerate}
\item[d)]No student in your class has a cat, a dog, and a ferret.
\begin{enumerate}
\item[]\answer $\neg \exists x (C(x) \wedge D(x) \wedge F(x))$
\end{enumerate}
\item[e)]For each of the three animals, cats, dogs, and ferrets, there is a student in your class who has this animal as a pet.
\begin{enumerate}
\item[]\answer$\exists x,y,z (C(x) \wedge D(y) \wedge F(z))$
\end{enumerate}
\end{enumerate}
\problem (\#14 S1.4 Pg53) Determine the truth value of each of these statements if the domain consists of all real numbers.
\begin{enumerate}
\item[a)]$\exists x (x^3 = -1)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[b)]$\exists x (x^4 < x^2)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c)]$\forall x ((-x)^2 = x^2)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[d)]$\forall x (2x>x)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#28 S1.4 Pg54) Translate each of these statements into logical expressions using predicates, quantifiers, and logical connectives.
\begin{enumerate}
\item[a)]Something is not in the correct place.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[b)]All tools are in the correct place and are in excellent condition.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c)]Everything is in the correct place and in excellent condition.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[d)]Nothing is in the correct place and is in excellent condition.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[e)]One of your tools is not in the correct place, but it is in excellent condition.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#32 S1.4 Pg55) Express each of these statements using quantifiers. Then form the negation of the statement so that no negation is to the left of a quantifier. Next, express the negation in simple English. (Do not simply use the phrase ``It is not the case that.'')
\begin{enumerate}
\item[a)]All dogs have fleas.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[b)]There is a horse that can add.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c)]Every koala can climb.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[d)]No monkey can speak French.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[e)]There exists a pig that can swim and catch fish.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#34 S1.4 Pg55) Express the negation of these propositions using quantifiers, and then express the negation in English.
\begin{enumerate}
\item[b)]All Swedish movies are serious.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c)]No one can keep a secret.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[d)]There is someone in this class who does not have a good attitude.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#36 S1.4 Pg55) Find a counterexample, if possible, to these universally quantified statements, where the domain for all variables consists of all real numbers.
\begin{enumerate}
\item[a)]$\forall x (x^2 \neq x)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[b)]$\forall x (x^2 \neq 2)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c)]$\forall x (|x| > 0)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#38 S1.4 Pg55) Translate these system specifications into English where the predicate $S(x, y)$ is ``$x$ is in state $y$'' and where the domain for $x$ and $y$ consists of all systems and all possible states, respectively.
\begin{enumerate}
\item[b)]$\forall x(S(x$, malfunctioning$) \vee S(x$, diagnostic))
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[e)]$\forall x \neg S(x$, working)
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#6 S1.5 Pg65) Let $C(x, y)$ mean that student $x$ is enrolled in class $y$, where the domain for $x$ consists of all students in your school and the domain for $y$ consists of all classes being given at your school. Express each of these statements by a simple English sentence.
\begin{enumerate}
\item[a)]$C$(Randy Goldberg, CS 252)
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[b)]$\exists x C(x$, Math 695)
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[d)]$\exists x (C(x$, Math 222$) \wedge C(x$, CS 252)
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#10 S1.5 Pg65) Let $F(x, y)$ be the statement ``$x$ can fool $y$,'' where the domain consists of all people in the world. Use quantifiers to express each of these statements.
\begin{enumerate}
\item[e)]Everyone can be fooled by somebody.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[g)]Nancy can fool exactly two people.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[h)]There is exactly one person whom everybody can fool.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[i)]No one can fool himself or herself.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[j)]There is someone who can fool exactly one person besides himself or herself.
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#28 S1.5 Pg67) Determine the truth value of each of these statements if the domain of each variable consists of all real numbers.
\begin{enumerate}
\item[a)]$\forall x \exists y (x^2 = y)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c)]$\exists x \forall y (xy = 0)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[e)]$\forall x(x \neq 0 \rightarrow \exists y(xy = 1))$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[g)]$\forall x \exists y (x + y = 1)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[i)]$\forall x \exists y (x + y = 2 \wedge 2x - y = 1)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#30 S1.5 Pg67) Rewrite each of these statements so that negations appear only within predicates (that is, so that no negation is outside a quantifier or an expression involving logical connectives).
\begin{enumerate}
\item[b)]$\neg \forall x \exists P(x, y)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[d)]$\neg \exists y (\exists x R(x, y) \vee \forall x S(x, y))$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[e)]$\neg \exists y (\forall x \exists z T(x, y, z) \vee \exists x \forall z U(x, y, z))$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#40 S1.5 Pg68) Find a counterexample, if possible, to these universally quantified statements, where the domain for all variables consists of all integers.
\begin{enumerate}
\item[a)]$\forall x \exists y(x = 1/y)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[b)]$\forall x \exists y(y^2 - x < 100)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c)]$\forall x \forall y(x^2 \neq y^3)$
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\problem (\#48 S1.5 Pg68) Show that $\forall x P(x) \vee \forall x Q(x)$ and $\forall x \forall y (P(x) \vee Q(y))$, where all quantifiers have the same nonempty domain, are logically equivalent. (the new variable $y$ is used to combine the quantifications correctly.)\vspace{.25cm}
\answerindent
\end{document}
\ No newline at end of file
hw03/HW03DanielShchur.tex~ 0 → 100644
+ 57
− 0
View file @ c38145f4
\documentclass[12pt,letterpaper]{article}
\usepackage{bm}
\usepackage{forest}
\usepackage[letterpaper, margin=.75in]{geometry}
\newcommand{\problem}{\vspace{.5cm}\textbf{Problem:~~}}
\newcommand{\answer}{\emph{Answer:~~}}
\newcommand{\ansindent}{\indent\hspace{0.5cm}}
\newcommand{\answerindent}{\hangindent=.5cm\hangafter=0\answer}
\newcommand{\ansend}{\vspace{0.25cm}\\}
\setlength{\parindent}{0pt}
\setlength{\parskip}{0cm}
\setlength{\intextsep}{.25cm}
\title{CSCE 235H Homework 03}
\author{Daniel Shchur}
\begin{document}
\maketitle
\problem (\#10 S1.4 Pg53)
\problem (\#14 S1.4 Pg53)
\problem (\#28 S1.4 Pg54)
\problem (\#32 S1.4 Pg55)
\problem (\#34 S1.4 Pg55)
\ansindent\answer
\begin{enumerate}
\item[b]
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[c]
\begin{enumerate}
\item[]\answer
\end{enumerate}
\item[d]
\begin{enumerate}
\item[]\answer
\end{enumerate}
\end{enumerate}
\end{document}
\ No newline at end of file
hw03/hw03.pdf 0 → 100755
+ 0
− 0
View file @ c38145f4
File added
hwSat01/HWSAT01DanielShchur.aux 0 → 100755
+ 1
− 0
View file @ c38145f4
\relax
hwSat01/HWSAT01DanielShchur.log 0 → 100755
+ 0
− 0
View file @ c38145f4
This diff is collapsed.
hwSat01/HWSAT01DanielShchur.pdf 0 → 100755
+ 0
− 0
View file @ c38145f4
File added
hwSat01/HWSAT01DanielShchur.tex 0 → 100644
+ 136
− 0
View file @ c38145f4
\documentclass[12pt,letterpaper]{article}
\usepackage{bm}
\usepackage{forest}
\usepackage[letterpaper, margin=.75in]{geometry}
\newcommand{\problem}[1]{\vspace{.5cm}\textbf{Problem{ #1}:~~}}
\newcommand{\answer}{\emph{Answer:~~}}
\newcommand{\ansindent}{\indent\hspace{0.5cm}}
\newcommand{\answerindent}{\hangindent=.5cm\hangafter=0\answer}
\newcommand{\ansend}{\vspace{0.25cm}\\}
\setlength{\parindent}{0pt}
\setlength{\parskip}{0cm}
\setlength{\intextsep}{.25cm}
\title{CSCE 235H SAT Homework 01}
\author{Daniel Shchur}
\begin{document}
\maketitle
\problem{A} Consider the following CNF Formula:
\begin{center}
\begin{tabular}{c c l}
$s1 =$ & & $(a \vee b \vee c)$\\
& $\wedge$ & $(a \vee \neg b)$\\
& $\wedge$ & $(a \vee \neg c)$\\
& $\wedge$ & $(c \vee \neg a)$\\
& $\wedge$ & $(\neg a)$\\
& $\wedge$ & $(b)$\\
\end{tabular}
\end{center}
Is it satisfiable? If so, provide a solution and show how \emph{each} clause is satisfied in that solution. If not, identify clause(s) that cannot possibly be satisfied and explain why.\vspace{0.25cm}
\answerindent The statement is not satisfiable because if $a=1$, the clause $(\neg a)$ is not satisfied, and if $a=0$ and $b=0$, then the clause $(b)$ is not satisfied, while if $b=1$, then the clause $(a \vee \neg b)$ is not satisfied. (See tree in Problem D)
\problem{B} Consider the following CNF formula:
\begin{center}
\begin{tabular}{c c l}
$s2 =$ & & $(a \vee b)$\\
& $\wedge$ & $(\neg a \vee b)$\\
& $\wedge$ & $(a \vee c)$\\
& $\wedge$ & $(\neg b \vee \neg c)$\\
\end{tabular}
\end{center}
Is it satisfiable? If so, provide a solution and show how \emph{each} clause is satisfied in the solution. If not, identify clause(s) that cannot possibly be satisfied and explain why.\vspace{.25cm}
\answerindent The statement is satisfiable by one solution, where $a=1$, $b=1$, and $c=0$. When those are as stated, $(a \vee b) \equiv (1 \vee 1)$, $(\neg a \vee b) \equiv (0 \vee 1)$, $(a \vee c) \equiv (1 \vee 0)$, and $(\neg b \vee \neg c) \equiv (0 \vee 1)$, which are all equivalent to true. (See tree in Problem D)
\newpage
\problem{C} Consider the following satisfiable CNF formula:
\begin{center}
\begin{tabular}{c c l}
$s3 =$ & & $(a \vee b \vee c \vee d)$\\
& $\wedge$ & $(\neg a \vee \neg b)$\\
& $\wedge$ & $(\neg c \vee \neg d)$\\
& $\wedge$ & $(a)$\\
\end{tabular}
\end{center}
How many unique solutions does it have? Explain your reasoning.\vspace{.25cm}
\answerindent There are 3 unique solutions. This is easily visible with a model such as the tree for Problem C in Problem D.
\problem{D} For each of the three CNF formulas from the previous problems, draw the binary tree of all possible combinations while pruning any branch as soon as it cannot be extended in a satisfiable manner.
\begin{center}
Problem A\ansend
\begin{forest}
for tree=draw
[{$(a \vee b \vee c) \wedge (a \vee \neg b) \wedge (b \vee \neg c) \wedge (c \vee \neg a) \wedge (\neg a) \wedge (b)$}
[{$a=0$}
[{$b=0$}, color=red]
[{$b=1$}, color=red]
]
[{$a=1$}, color=red]
]
\end{forest}
\end{center}
\begin{center}
Problem B\ansend
\begin{forest}
for tree=draw
[{$(a \vee b) \wedge (\neg a \vee b) \wedge (a \vee c) \wedge (\neg b \vee \neg c)$}
[{$a=0$}
[{$b=0$}, color=red]
[{$b=1$}
[{$c=0$}, color=red]
[{$c=1$}, color=red]
]
]
[{$a=1$}
[{$b=0$}, color=red]
[{$b=1$}
[{$c=0$}, color={green!75!black}]
[{$c=1$}, color={red}]
]
]
]
\end{forest}
\end{center}
\begin{center}
Problem C\ansend
\begin{forest}
for tree=draw
[{$(a \vee b \vee c \vee d) \wedge (\neg a \vee \neg b) \wedge (\neg c \vee \neg d) \wedge (a)$}
[{$a=0$}, color=red]
[{$a=1$}
[{$b=0$}
[{$c=0$}
[{$d=0$}, color={green!75!black}]
[{$d=1$}, color={green!75!black}]
]
[{$c=1$}
[{$d=0$}, color={green!75!black}]
[{$d=1$}, color=red]
]
]
[{$b=1$}, color=red]
]
]
\end{forest}
\end{center}
\end{document}
\ No newline at end of file
hwSat01/HWSAT01DanielShchur.tex~ 0 → 100644
+ 22
− 0
View file @ c38145f4
\documentclass[12pt,letterpaper]{article}
\usepackage[table]{xcolor}
\usepackage{boldline}
\usepackage{bm}
\usepackage{forest}
\usepackage[letterpaper, margin=.75in]{geometry}
\usepackage{adjustbox}
\newcommand{\problem}{\vspace{.5cm}\textbf{Problem:~~}}
\newcommand{\answer}{\emph{Answer:~~}}
\newcommand{\ansindent}{\indent\hspace{0.5cm}}
\newcommand{\ansend}{\vspace{0.25cm}\\}
\newcommand{\rot}[1]{\multicolumn{1}{c}{\adjustbox{angle=90}{#1}}‌​}
\newcommand{\rotend}[1]{\multicolumn{1}{c V{3}}{\adjustbox{angle=90}{#1}}‌​}
\setlength{\parindent}{0pt}
\setlength{\parskip}{0cm}
\setlength{\intextsep}{.25cm}
\title{CSCE 235H SAT Homework 01}
\author{Daniel Shchur}
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment