\documentclass[12pt]{article}
\usepackage{amsfonts}

\voffset=-3.0cm
\hoffset=-2.6cm
\textwidth=17.5cm
\textheight=24cm

\renewcommand{\not}{\neg}
\renewcommand{\and}{\wedge}
\renewcommand{\or}{\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 Computational Logic, WS 2018.
Homework 3, given Oct. 30, due Nov 6.}

\bigskip

\noindent
1.
Study the syntax, semantics, and the elementary properties of disjunctive sets
(similar to the study of conjunctive sets performed in the lecture).

\bigskip

\noindent
2.
Find the simplification equivalence for the formula $A \or (A \and B)$
and its generalization[s] for conjunction and disjunction applied to sets.

\bigskip

\noindent
3.
Express the distributivity of conjunction over disjunction in the syntactical
version with sets (see the dual relation in the lecture).


\bigskip

\noindent
4.
Find simplification equivalences using implication and equivalence when one of
the subformula is a truth constant.

\end{document}


