\documentclass[12pt]{article}
\usepackage{amsfonts}
 
\voffset=-3.0cm
\hoffset=-2.6cm
\textwidth=17.5cm
\textheight=24cm

\renewcommand{\not}{\neg}
\newcommand{\aand}{\wedge}
\newcommand{\oor}{\vee}
\newcommand{\impl}{\Rightarrow}
\newcommand{\lequiv}{\Leftrightarrow} %equivalence as logical connective
\newcommand{\all}{\forall}
\newcommand{\exi}{\exists}
\newcommand{\elc}{\models}  % semantic logical consequence
\newcommand{\ylc}{\vdash}  % syntactic logical consequence
%\equiv is already defined for === semantic equivalence
\newcommand{\union}{\cup}
\newcommand{\intersect}{\cap}
\newcommand{\true}{{\mathbb{T}}}
\newcommand{\false}{{\mathbb{F}}}


\pagestyle{empty}

\begin{document}

{\bf Automated Reasoning, WS 2015.
Homework 1, given Oct 7, due Oct 13}

\bigskip

\bigskip

\noindent

A. From the book by Chang and Lee:

page 23, ex. 1: (a, b, c);

page 23, ex. 2: (a, c, e).

\bigskip

B. Determine the truth value of the formula
$$(\neg P \oor Q) \aand (\neg (P \aand \neg Q))$$
under the interpretations:
$I_1 =\{P = True, Q = False \}$ and 
$I_2 =\{P = False, Q = True \}.$




\end{document}
